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

priority_queue<int>q;
int n,m,k,l,s,t,r;
string p;
vector<int>ans;
int main()
{
    ios::sync_with_stdio(false);
    int T;
    cin>>T;
    while (T--)
    {
        ans.clear();
        while (!q.empty())
            q.pop();
        cin>>p;
        l=p.length();
        int sum=0;
        for(int i=0;i<l;i++)
            if(p[i]=='^')
            {
                if(sum!=0)
                    q.push(sum+1);
                sum=0;

            }
            else sum++;
        if(sum!=0)
            q.push(sum+1);
      //  cout<<"--"<<q.top()<<endl;
        for(int i=21;i>=0;i--)
        {
            int f;
            if(q.empty())
                f=0;
            else
            f=q.top();
            if(f>=(1<<i))
            {
                ans.push_back(1);
                f=f-(1<<i);
                q.pop();
                if(f!=0)
                    q.push(f);
            }
            else ans.push_back(0);
        }
        int out=0;
        //cout<<l<<endl;
        if((l+1)%2==1)
            out=1;
        reverse(ans.begin(),ans.end());
        //for(int i:ans)
          //  cout<<i<<" ";
       // cout<<endl;
        for(int i=1;i<=21;i++)
        {
            out+=ans[i]*(1<<i);
        }
        cout<<out<<endl;

    }


    return 0;
}