#pragma GCC optimize(3)
#pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define REP(i,n) for(int i=(0);i<(n);i++)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
using namespace std;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef long long ll;

const int mod=1e9+7;
const int N=(1<<21)+5;
int f[N],g[N][23],mark[N],n,K,ALL;
char s[N];

const inline int fix(const int &x){
    return x>=mod?x-mod:x;
}

void MAIN(){
    scanf("%s",s+1);
    n=strlen(s+1)+1,K=0;
    while((1<<K)<=n)K++;
    ALL=(1<<K)-1;

    memset(g,0,4*(n+1)*23);
    fill(f,f+n+1,0);
    fill(mark,mark+n+1,0);
    int flag=(n==(1<<21)-1);
    rep(i,1,n-1){
        mark[i]=(s[i]=='+');
        if(s[i]=='+')flag=0;
    }
    if(flag){
        puts("2097151 302867411");
        return;
    }
    g[0][K]=1;
    rep(s,0,n)if((s&n)==s){
        rep(k,0,K-1)if(g[s][k]){
            g[s][k+1]=fix(g[s][k+1]+g[s][k]);
            if(!(s>>k&1)&&(n&(1<<k)))
                g[s|(1<<k)][k+1]=fix(g[s|(1<<k)][k+1]+g[s][k]);
        }
        if(!mark[s]&&g[s][K]){
            f[s]=g[s][K];
            rep(k,0,K-1)if(!(s>>k&1))
                g[s|(1<<k)][k+1]=fix(g[s|(1<<k)][k+1]+f[s]);
        }
    }

    printf("%d %d\n",n,f[n]);
}

int main(){
    int T;scanf("%d",&T);
    while(T--)MAIN();
    return 0;
}