清北国庆day1 （脑）残

（留坑）

/*
不知道为什要找的循环节TM这么长
*/
#include<cstdio>
#include<cstdlib>
#include<cstring>

using namespace std;

#ifdef unix
#define LL "%lld"
#else
#define LL "%I64d"
#endif

const int maxn=;
const long long mo=;
const long long mo2=mo*+;
const long long mo3=mo2*;

char s[maxn];

struct matrix
{
    long long z[][];
    matrix()
    {
        memset(z,,sizeof(z));
    }
    matrix operator*(const matrix &a)const
    {
        matrix ans;
        for (int b=;b<=;b++)
            for (int c=;c<=;c++)
                for (int d=;d<=;d++)
                    ans.z[b][c]=(ans.z[b][c]+z[b][d]*a.z[d][c]%mo)%mo;
        return ans;
    }
    matrix operator+(const matrix &a)const
    {
        matrix ans;
        for (int b=;b<=;b++)
            for (int c=;c<=;c++)
                for (int d=;d<=;d++)
                    ans.z[b][c]=(ans.z[b][c]+z[b][d]*a.z[d][c]%mo2)%mo2;
        return ans;
    }
}m1,m2;

struct bign
{
    int z[maxn],l;
    void init()
    {
        memset(z,,sizeof(z));
        scanf("%s",s+);
        l=strlen(s+);
        for (int a=;a<=l;a++)
            z[a]=s[l-a+]-'';
    }
    long long operator%(const long long &a)const
    {
        long long b=;
        for (int c=l;c>=;c--)
            b=(b*+z[c])%a;
        return b;
    }
}z;

long long get(long long v)
{
    if (v==) return ;
    m1.z[][]=;
    m1.z[][]=;
    m2.z[][]=;
    m2.z[][]=m2.z[][]=m2.z[][]=;
    while (v)
    {
        if (v&) m1=m1*m2;
        m2=m2*m2;
        v>>=;
    }
    return m1.z[][];
}

long long get1(long long v)
{
    if (v==) return ;
    m1.z[][]=;
    m1.z[][]=;
    m2.z[][]=;
    m2.z[][]=m2.z[][]=m2.z[][]=;
    while (v)
    {
        if (v&) m1=m1+m2;
        m2=m2+m2;
        v>>=;
    }
    return m1.z[][];
}

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

    int t;
    scanf("%d",&t);
    for (int a=;a<=t;a++)
    {
        z.init();
        long long v1=z % mo3;
        v1=get1(v1);
        printf(LL "\n",get(v1));
    }

    return ;
}