#include<cstdio>

 #include<cstring>

 #include<algorithm>

 #include<iostream>

 #include<deque>

 using namespace std;

 #define maxn 2005

 char str[maxn];

 int dp[maxn][maxn];

 int judge(int i,int j)

 {

     int tot = ;

     if(str[i] != '{') tot++;

     if(str[j] != '}') tot++;

     return tot;

 }

 deque<char> que;

 int main()

 {

 //    freopen("in.txt","r",stdin);

 //    freopen("out.txt","w",stdout);

     int kase = ;

     while(scanf("%s",str)!=EOF)

     {

         int len = strlen(str),ans = ;

         if(str[] == '-') break;

         que.clear();

         for(int i = ;i < len;++i)

         {

             if(str[i] == '{')

             que.push_front(str[i]);

             else

             {

                 if(que.empty())

                 {

                     que.push_front('{');

                     ans++;

                 }

                 else que.pop_front();

             }

         }

         if(!que.empty())

         ans += (que.size()/);

         printf("%d. %d\n",kase++,ans);

     }

     return ;

 }

 /*        memset(dp,0,sizeof(dp));

         for(int i = len-1;i >= 0;--i)

         for(int j = i + 1;j < len;j+=2)

         {

             dp[i][j] = 0x7fffffff;

             if(j == i + 1) dp[i][j] = judge(i,j);

             else

             {

                 dp[i][j] = min(dp[i+1][j-1]+judge(i,j),dp[i][j]);

                 if(j >= 2)

                 dp[i][j] = min(dp[i][j-2]+judge(j-1,j),dp[i][j]);

                 if(i+2 < len)

                 dp[i][j] = min(dp[i+2][j]+judge(i,i+1),dp[i][j]);

             }

         }

         printf("%d. %d\n",kase++,dp[0][len-1]);

     }

     return 0;

 }*/