const int maxn =  + ;

struct node {

    int val;

    int id;

    bool operator < (const struct node & rhs) const {

        if (val != rhs.val) return val < rhs.val;

        else return id < rhs.id;

    }

}a[maxn];

int n;

int f[maxn];

int lena;

map<string, bool>mp;

int aa;

void dfs(int cur) {

    if (cur == n + ) {

        for (int i = ; i <= n; ++i) {

            a[i].val = f[i];

            a[i].id = i;

        }

        sort(a + , a +  + n);

        string s;

        s += 'A' + a[].id - ;

        for (int i = ; i <= n; ++i) {

            if (a[i].val == a[i - ].val) {

                s += "=";

            } else s += "<";

            s += 'A' + a[i].id - ;

        }

        if (mp[s]) return;

        if (s[] == 'C') {

            cout << s << endl;

            aa++;

        }

        mp[s] = true;

        return;

    }

    for (int i = ; i <= n; ++i) {

        f[cur] = i;

        dfs(cur + );

    }

}

void work() {

    n = ;

    dfs();

    cout << mp.size() << endl;

    cout << aa << endl;

}

#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <cmath>

#include <algorithm>

#define IOS ios::sync_with_stdio(false)

using namespace std;

#define inf (0x3f3f3f3f)

typedef long long int LL;

#include <iostream>

#include <sstream>

#include <vector>

#include <set>

#include <map>

#include <queue>

#include <string>

#include <iomanip>

const int maxn =  + ;

void bigadd (char str1[],char str2[],char str3[]) {    //str1 + str2 = str3

    int len1=strlen(str1+),len2=strlen(str2+);

    char b[maxn]= {};

    int i=len1,j=len2;

    int h=;

    while (i>= && j>=)  b[h++] = str1[i--]-'' + str2[j--]-'';

    while (i>=)         b[h++] = str1[i--]-'';

    while (j>=)         b[h++] = str2[j--]-'';

    for (int i=; i<h; i++) { //h是理论越界的

        if (b[i] >= ) {

            b[i+]++;

            b[i] -= ;

        }

    }

    if (!b[h]) --h;//没有进位到越界位。

    int t=h;

    for (int i=; i<=h; i++)  str3[t--]=b[i]+'';

    str3[h+]='\0'; //一定要手动添加结束符，不然会GG

    return ;

}

char a[maxn][maxn][maxn];

char last[maxn];

char t[maxn];

void init() {

//    a[1][1] = 1.0;

    strcpy(a[][] + , "");

//    long double last = 1.0;

    strcpy(last + , "");

    for (int j = ; j <= ; ++j) {

//        a[j][j] = last;

        strcpy(a[j][j] + , last + );

//        printf("%s\n", a[j][j] + 1);

        for (int i = j - ; i >= ; --i) {

//            a[i][j] = a[i + 1][j] + a[i][j - 1];

            bigadd(a[i + ][j], a[i][j - ], a[i][j]);

//            printf("%s\n", a[i][j] + 1);

        }

//        last = 0;

        memset(t, , sizeof t);

        for (int k = j; k >= ; --k) {

//            last += a[k][j];

            bigadd(a[k][j], t, last);

            strcpy(t + , last + );

        }

    }

}

void work() {

    int n;

    scanf("%d", &n);

    printf("%s\n", a[n + ][n + ] + );

}

int main() {

#ifdef local

    freopen("data.txt","r",stdin);

#endif

    init();

    int t;

    scanf("%d", &t);

    while (t--) work();

    return ;

}