#include<bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define SZ(x) ((int)x.size())
#define L(i,u) for (register int i=head[u]; i; i=nxt[i])
#define rep(i,a,b) for (register int i=(a); i<=(b); i++)
#define per(i,a,b) for (register int i=(a); i>=(b); i--)
using namespace std;
typedef long long ll;
typedef unsigned int ui;
typedef pair<int,int> Pii;
typedef vector<int> Vi;
template<class T> inline void read(T &x){
    x=0; char c=getchar(); int f=1;
    while (!isdigit(c)) {if (c=='-') f=-1; c=getchar();}
    while (isdigit(c)) {x=x*10+c-'0'; c=getchar();} x*=f;
}
template<class T> inline void umin(T &x, T y){x=x<y?x:y;}
template<class T> inline void umax(T &x, T y){x=x>y?x:y;}
inline ui R() {
    static ui seed=416;
    return seed^=seed>>5,seed^=seed<<17,seed^=seed>>13;
}
//const int N = ;
char s[1<<21|3];int n,res,res1;
inline void upd(int x){
    if(x&1)res1^=1;x>>=1;
    if(res<x)swap(res,x);
    int mx=0;while((1<<mx+1)<=x)mx++;
    per(bit,mx,0)if(x>>bit&1){
        if(!(res>>bit&1))res|=1<<bit;
        else{res|=(1<<bit)-1;break;}
    }
}
int main() {
    int T;read(T);
    while(T--){
        scanf("%s",s+1);n=strlen(s+1);res=res1=0;
        s[0]=s[n+1]='^';
        for(int i=1,j=0;i<=n+1;i++){
            if(s[i]=='^')upd(i-j),j=i;
        }
        printf("%d\n",res*2+res1);
    }
    /*ok[1][1]=1;
    int n=100;
    rep(i,2,100){
        ok[i][i]=1;
        rep(j,1,i-1)
            rep(x,0,n*2)if(ok[j][x])
                rep(y,0,n*2)if(ok[i-j][y])
                    ok[i][x^y]=1;
    }
    rep(i,1,30){
        rep(j,0,i*2)printf("%d",ok[i][j]);
        puts("");
    }*/
    return 0;
}