#include<bits/stdc++.h>
using namespace std;

const int nmax=1e5+42,base=131,mod=987654323;

int n;

char inp[nmax];

int done[nmax],on[nmax];

long long hsh[nmax],pwr[nmax];

pair<int/*size*/,int/*times*/> outp[nmax];

int ask_hsh(int l,int r)
{
    long long LHS=hsh[r];

    long long RHS=hsh[l-1]*pwr[r-l+1]%mod;

    return (LHS-RHS+mod)%mod;
}
bool same(int l,int r,int lq,int rq)
{
    if(r>n||rq>n)return 0;

    if(done[r]!=done[l-1]||done[rq]!=done[lq-1])return 0;

    if(ask_hsh(l,r)!=ask_hsh(lq,rq))return 0;

    return 1;
}

int SZ(int num)
{
    int ret=0;

    while(num)
    {
        num=num/10;
        ret++;
    }

    return ret;
}

bool letter(char c)
{
    return 'a'<=c&&c<='z';
}
bool by_hand(int i,int j,int d)
{
    if(letter(inp[i])==0&&inp[i]!='[')return 0;
    if(letter(inp[j-1])==0&&inp[j-1]!=']')return 0;

    while(i+d<j)
    {
        if(inp[i]!=inp[i+d])return 0;

        i++;
    }

    int cnt_open=0,cnt_comma=0,cnt_close=0;

    for(int p=i;p<j;p++)
    {
        if(inp[p]=='[')cnt_open++;

        if(inp[p]==',')cnt_comma++;

        if(inp[p]==']')cnt_close++;

        //if(i==1&&j==29)cout<<p<<" "<<cnt_open<<" "<<cnt_comma<<" "<<cnt_close<<endl;

        if(cnt_open>=cnt_comma&&cnt_comma>=cnt_close);
        else return 0;
    }

    return cnt_open==cnt_comma&&cnt_comma==cnt_close;
}
void go(int d)
{
    for(int i=1;i<=n;i++)
        done[i]=done[i-1]+1-on[i];

    for(int i=1;i<=n;i++)
    {
        int j=i+d;

        while(same(i,i+d-1,j,j+d-1))j=j+d;

        int dist_now=j-i;

        int compressed=1+d+1+SZ(dist_now/d)+1;

        //if(d==14)cout<<d<<" "<<i<<" "<<j<<" -> "<<dist_now<<" "<<compressed<<endl;

        if(dist_now>compressed)
            if(by_hand(i,j,d))
            {
                outp[i]={d,dist_now/d};

                for(int p=i;p<j;p++)
                    on[p]=0;

                i=j-1;
            }
    }
}

char given[nmax];

double T;

int pointer=0;

string my_to_string(int val)
{
    string ret="";

    while(val)
    {
        ret.push_back(char('0'+val%10));
        val=val/10;
    }

    reverse(ret.begin(),ret.end());
    return ret;
}

bool valid(char c)
{
    if('a'<=given[n]&&given[n]<='z')return 1;

    if('0'<=given[n]&&given[n]<='9')return 1;

    if(given[n]=='['||given[n]==']'||given[n]==',')return 1;

    return 0;
}
bool compress(double flag)
{
    if(1.0*(clock()-T)/CLOCKS_PER_SEC>flag)return 0;

    n=0;

    while(valid(given[n]))n++;

    for(int i=1;i<=n;i++)inp[i]=given[i-1];

    for(int i=1;i<=n;i++)outp[i]={1,1};

    pwr[0]=1;
    for(int i=1;i<=n;i++)pwr[i]=1LL*base*pwr[i-1]%mod;

    for(int i=1;i<=n;i++)hsh[i]=(1LL*hsh[i-1]*base+inp[i])%mod;

    for(int i=1;i<=n;i++)on[i]=1;

    for(int d=1;d<=n&&1.0*(clock()-T)/CLOCKS_PER_SEC<flag;d++)
        go(d);

    //for(int i=1;i<=n;i++)cout<<outp[i].first<<" "<<outp[i].second<<endl;
    string to_write="";

    for(int i=1;i<=n;i++)
    {
        //cout<<"i= "<<i<<" to_write= "<<to_write<<endl;

        if(outp[i].second==1)
        {
            to_write.push_back(inp[i]);
            continue;
        }
        else
        {
            to_write.push_back('[');

            for(int j=i;j<i+outp[i].first;j++)
                to_write.push_back(inp[j]);

            to_write.push_back(',');

            string help=my_to_string(outp[i].second);

            for(auto w:help)
                to_write.push_back(w);

            //printf(",%i]",outp[i].second);
            to_write.push_back(']');

            i=i+outp[i].first*outp[i].second-1;
        }
    }

    //cout<<to_write<<endl;

    pointer=0;

    for(int i=0;i<=n;i++)given[i]='\n';

    for(auto w:to_write)
    {
        given[pointer]=w;
        pointer++;
    }

    return n>pointer;

    //cout<<"ok? "<<pointer<<endl;
}

int wrong[nmax];

int main()
{
    freopen("pattern.in","r",stdin);
    freopen("pattern.out","w",stdout);

    T=clock();

    scanf("%s",&given);

    compress(4.0);

    compress(4.3);

    compress(4.5);

    compress(4.6);

    compress(4.7);

    while(compress(4.7));

    //search for #

    n=0;

    while(valid(given[n]))n++;

    for(int i=1;i<=n;i++)inp[i]=given[i-1];

    for(int i=1;i<=n;i++)outp[i]={1,1};

    pwr[0]=1;
    for(int i=1;i<=n;i++)pwr[i]=1LL*base*pwr[i-1]%mod;

    for(int i=1;i<=n;i++)hsh[i]=(1LL*hsh[i-1]*base+inp[i])%mod;

    for(int i=1;i<=n;i++)
        wrong[i]=wrong[i-1]+!('a'<=inp[i]&&inp[i]<='z');

    for(int i=1;i<=n;i++)
        done[i]=0;

    string save="";
    int best_diff=0;

    vector<int> where={};

    /*
    cout<<"given now"<<endl;
    for(int i=0;i<pointer;i++)
        printf("%c",given[i]);
    cout<<endl;
    */

    for(int d=2;d<=n;d++)
    {
        for(int i=1;i<=n-d+1&&1.0*(clock()-T)/CLOCKS_PER_SEC<4.8;i++)
            if(wrong[i+d-1]==wrong[i-1])
            {
                //cout<<"testing ";for(int p=0;p<d;p++)cout<<inp[i+p];cout<<endl;

                vector<int> there={};

                int j=i;

                int cnt=0;

                while(j+d-1<=n)
                {
                    if(wrong[j+d-1]!=wrong[j-1])j++;
                    else
                    {
                        if(same(i,i+d-1,j,j+d-1))
                        {
                            there.push_back(j);

                            cnt++;
                            j=j+d;
                        }
                        else j++;
                    }
                }

                int diff=(d-1)*cnt-(d+3);

                //cout<<"cnt= "<<cnt<<" diff= "<<diff<<endl;

                if(diff>best_diff)
                {
                    int actual_cnt=0;

                    //cout<<"there: ";for(auto j:there)cout<<j<<" ";cout<<endl;

                    for(auto j:there)
                    {
                        bool ok=1;

                        for(int p=0;p<d&&ok;p++)
                            if(inp[i+p]!=inp[j+p])ok=0;

                        if(ok)actual_cnt++;
                    }

                    int actual_diff=(d-1)*actual_cnt-(d+3);

                    //cout<<"actual_diff= "<<actual_diff<<endl;

                    if(actual_diff>best_diff)
                    {
                        best_diff=actual_diff;
                        where=there;

                        save="";
                        for(int p=0;p<d;p++)
                            save.push_back(inp[i+p]);
                    }
                }
            }
    }

    if(save=="")
    {
        for(int i=0;i<pointer;i++)
            printf("%c",given[i]);
    }
    else
    {
        set<int> skip={};
        for(auto w:where)
            skip.insert(w-1);

        printf("#=");

        for(auto w:save)printf("%c",w);

        printf(".");

        for(int i=0;i<pointer;i++)
        {
            if(skip.count(i))
            {
                printf("#");
                i=i+save.size()-1;
            }
            else
            {
                printf("%c",given[i]);
            }
        }
    }
    return 0;
}