# include <bits/stdc++.h>
using namespace std;
mt19937 rand_Gen(15645865);
const long long BASE = 31;
const long long MOD = 1e9+7;
const long long MOD2 = 1e9+27;
const long long maxn = 1e5+5;
const clock_t begin_time = clock();
const float Final_Time = 4.6;
const float Time_Per_Test = 0.5;
bool lefttime()
{
    return ( float( clock () - begin_time ) /  CLOCKS_PER_SEC<Final_Time);
}
string tonum(long long a)
{
    string ans = "";
    long long i;
    while(a!=0)
    {
        char t = ((a%10)+'0');
        ans =  t + ans;
        a/=10;
    }
    return ans;
}
long long mod(long long a, long long MOD)
{
    return a%MOD;
    while(a>=MOD)
        a-=MOD;
    return a;
}
string s;
string ans = "";
map <pair <long long, long long>, long long> mp;
pair <long long, long long>  bases[maxn];
pair <long long, long long> dp[maxn];
pair <long long, long long> qw[maxn];
map <pair <long long, long long>, long long> last;
bool is[maxn],words[28];
long long precalc(string s, long long len)
{
    mp.clear();
    last.clear();
    long long i = 0;
    pair <long long, long> w = {0,0},q;
    long long maxs = 0 ;

    for(i=0;i<s.size();i++)
    {

        w.first = mod(w.first*BASE+(s[i]-'a'+1),MOD);
        w.second = mod(w.second*BASE+(s[i]-'a'+1),MOD2);
        dp[i] = w;
        if(i+1>=len)
        {
            pair <long long, long> t;
            t.first  = mod((w.first - (i>=len ? mod(dp[i-len].first*bases[len].first,MOD) : 0)+MOD),MOD);
            t.second  = mod(w.second - (i>=len ? mod(dp[i-len].second*bases[len].second,MOD2) : 0)+MOD2,MOD2);
          // cout<<len<<" :: "<< i<< " "<< t<<" "<<w<< endl;
          if(last.count(t)==0||i-last[t]>=len)
          {
              mp[t]++;
            qw[i-len+1] = t;
            last[t] = i;
            if(mp[t]>maxs){maxs=mp[t];q=t;}
          }

        }
    }
    for(i=0;i<s.size();i++)
    {
      //  cout<<i<<"  ->  "<<qw[i]<<endl;
        if(qw[i].first==q.first&&qw[i].second==q.second)is[i] = 1;
        else
            is[i] = 0;
    }
    return maxs;

}/*
bool zz[26][5];
int ks[5];
pair <string,int> possiblecompres(string s, int len)
{
    int i,j;
    for(i=0;i<=len;i++)
    {
        ks[i] = 0;
        for(j=0;j<26;j++)
            zz[j][i]=0;
    }
    for(i=0;i<s.size();i+=len)
    {
        for(j=0;j<len;j++)
        {
            int ch = s[i+j]-'a';
            if(zz[ch][j]==0)
            {
                zz[ch][j] = 1;
                ks[j]++;
            }
        }
    }
    string ans = "";
    int num = 0;
    if(ks[j]==1)
    {
        ans = s[0];
        for(i=1;i<len;i++)
        {
            if(ks[i]==1)
            {
                ans+=s[i];

            }
            else
            {
                num+=(s.size()/len)*ks[i];
                ans+="?(";
                for(j=0;j<26;j++)
                {
                    if(zz[j][i]==1)
                    { ans+=(j+'a');
                        ans+=',';
                    }

                }
                ans[ans.size()-1]=')';
            }
        }
    }
    else
    return {"",1e9};
    ans = '['+ans+','+tonum(s.size()/len)+']';
    return {ans,num};
}*/
string COMPRESS(string s)
{
    string ans = "";
    int i,j;
int num = 1;
for(i=1;i<s.size();i++)
{
    if(s[i]==s[i-1]){num++;continue;}
    else
    {
        if(num<=5)
        {
            for(j=1;j<=num;j++)
                ans+=s[i-1];

        }
        else
        {
            ans = ans +'[' + s[i-1]+','+tonum(num)+']';
        }
        num = 1;
    }
}
if(num<=5)
        {
            for(j=1;j<=num;j++)
                ans+=s[i-1];

        }
        else
        {
            ans = ans +'[' + s[i-1]+','+tonum(num)+']';
        }
        num = 0;
        return ans;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
freopen("pattern.in","r",stdin);
freopen("pattern.out","w",stdout);

cin>>s;long long i,j;
string ANS2;
int ans2 = 1e9;
/*for(i=2;i<=4;i++)
{
    if(s.size()%i!=0)continue;
    auto V = possiblecompres(s,i);
    if(V.second<ans2){ANS2 = V.first; ans2 = V.second;}
}*/
int BR = 0;
for(i=0;i<s.size();i++)
{
    if(!words[s[i]-'a'])BR++;
    words[s[i]-'a'] = 1;
}
bases[0].first=bases[0].second  = 1;
for(i=1;i<=s.size();i++)
{
    bases[i].first = mod(bases[i-1].first*BASE,MOD);
    bases[i].second = mod(bases[i-1].second*BASE,MOD2);
}

long long num = 1;
long long uk1 = 2;
long long uk2 = s.size()/2;
long long mid;
long long prev = uk2/100;
if(s.size()<=10000)
    prev=  1;
long long best = 0, z=-1;
//precalc(s,1);
//if(BR<=4)
    {
for(mid=uk1;mid<=uk2&&lefttime();mid+=prev)
{
   // cout<<mid<<endl;
   // mid = (uk1+uk2+1)/2;
    long long x = precalc(s,mid);
  //  cout<<mid<<" && "<<x<<endl;
    if(x*mid-x-mid>best){best = x*mid-x-mid;z=  mid;}
    //if(mid*x-x-mid>prev)uk1 = mid;
   // else
    //uk2 = mid-1;
}
if(best!=0&&z>2){
precalc(s,z);
//cout<<z<<endl;
//for(i=0;i<s.size();i++)
  //  cout<<is[i]<<" ";
//cout<<endl;
ans = "#=";
string p = "";
for(i=0;i<s.size();i++)
{
    if(is[i])
    {
        for(j=0;j<z;j++)
        {
            p+=s[i+j];
        }
        break;
    }
}
ans += COMPRESS(p);
ans+='.';}
else
{
    for(i=0;i<s.size();i++)is[i] = 0;
}}
num = 0;
for(i=0;i<s.size();i++)
{
   // cout<<i<<" "<<num<<endl;
    if(!is[i]&&num==0)
    {
        num++;continue;
    }

    if(!is[i]&&s[i]==s[i-1]){num++;continue;}
    else
    {
        //cout<<"HERE"<<endl;

        if(num<=5)
        {
            for(j=1;j<=num;j++)
                ans+=s[i-1];

        }
        else
        {
            ans = ans +'[' + s[i-1]+','+tonum(num)+']';
        }
        if(is[i])
        {
            ans+='#';
            i+=(z);
        }
        i--;
        num = 0;

    }
}
if(num<=5)
        {
            for(j=1;j<=num;j++)
                ans+=s[i-1];

        }
        else
        {
            ans = ans +'[' + s[i-1]+','+tonum(num)+']';
        }
        num = 0;
      //  if(ans.size()>ans2){ans=ANS2;}
cout<<ans<<endl;

return 0;
}