#include <bits/stdc++.h>

using namespace std;

typedef long long          ll;
typedef unsigned long long ull;
typedef vector<int>         vi;
typedef vector<bool>       vb;
typedef map<int, int>      mii;
typedef pair<int, int>     ii;

#define INF                0x3f3f3f3f
#define INFLL              0x3f3f3f3f3f3f3f3f
#define each(x, s)         for(auto& x : s)
#define loop(x)            for(int i = 0;i < x;i++)
#define vloop(v, x)        for(int v = 0;v < x;v++)
#define avg(l, r)          l + (r - l) / 2
#define iter(a)            a.begin(), a.end()
#define riter(a)           a.rbegin(), a.rend()
#define endl               "\n"

const ll mod = 1000000007;
const double EPS = 1e-7;
const double PI = acos(-1);

map<tuple<int, int, int, int, int>, char> decode = {
  {{1,0,0,1,0}, 'a'},
  {{1,1,0,2,0}, 'b'},
  {{2,0,0,1,1}, 'c'},
  {{2,1,0,1,2}, 'd'},
  {{1,1,0,1,1}, 'e'},
  {{2,1,0,2,1}, 'f'},
  {{2,2,0,2,2}, 'g'},
  {{1,2,0,2,1}, 'h'},
//{{1,1,0,1,1}, 'i'},
  {{1,2,0,1,2}, 'j'},
  {{1,0,1,2,0}, 'k'},
  {{1,1,1,3,0}, 'l'},
  {{2,0,1,2,1}, 'm'},
  {{2,1,1,2,2}, 'n'},
  {{1,1,1,2,1}, 'o'},
  {{2,1,1,3,1}, 'p'},
  {{2,2,1,3,2}, 'q'},
  {{1,2,1,3,1}, 'r'},
//{{1,1,1,2,1}, 's'},
  {{1,2,1,2,2}, 't'},
  {{1,0,2,2,1}, 'u'},
  {{1,1,2,3,1}, 'v'},
  {{1,2,1,1,3}, 'w'},
  {{2,0,2,2,2}, 'x'},
  {{2,1,2,2,3}, 'y'},
  {{1,1,2,2,2}, 'z'}
};

int main() {
  ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);

  int n;
  cin >> n;
  string s = "";
  loop(n) {
    int a, b, c, d, e;
    cin >> a >> b >> c >> d >> e;
    s += decode[make_tuple(a, b, c, d, e)];
  }
  cout << s << endl;
  return 0;
}


### Prompt

Create a solution in Cpp for the following problem:



Input

The first line of the input contains a single integer N (1 ≤ N ≤ 24). The next N lines contain 5 space-separated integers each. The first three integers will be between 0 and 2, inclusive. The last two integers will be between 0 and 3, inclusive. The sum of the first three integers will be equal to the sum of the last two integers.

Output

Output the result – a string of lowercase English letters.

Examples

Input


1
1 0 0 1 0


Output


a


Input


10
2 0 0 1 1
1 1 1 2 1
2 1 0 1 2
1 1 0 1 1
2 1 0 2 1
1 1 1 2 1
1 2 1 3 1
2 0 0 1 1
1 1 0 1 1
1 1 2 2 2


Output


codeforcez

### Response

```cpp
#include <bits/stdc++.h>

using namespace std;

typedef long long          ll;
typedef unsigned long long ull;
typedef vector<int>         vi;
typedef vector<bool>       vb;
typedef map<int, int>      mii;
typedef pair<int, int>     ii;

#define INF                0x3f3f3f3f
#define INFLL              0x3f3f3f3f3f3f3f3f
#define each(x, s)         for(auto& x : s)
#define loop(x)            for(int i = 0;i < x;i++)
#define vloop(v, x)        for(int v = 0;v < x;v++)
#define avg(l, r)          l + (r - l) / 2
#define iter(a)            a.begin(), a.end()
#define riter(a)           a.rbegin(), a.rend()
#define endl               "\n"

const ll mod = 1000000007;
const double EPS = 1e-7;
const double PI = acos(-1);

map<tuple<int, int, int, int, int>, char> decode = {
  {{1,0,0,1,0}, 'a'},
  {{1,1,0,2,0}, 'b'},
  {{2,0,0,1,1}, 'c'},
  {{2,1,0,1,2}, 'd'},
  {{1,1,0,1,1}, 'e'},
  {{2,1,0,2,1}, 'f'},
  {{2,2,0,2,2}, 'g'},
  {{1,2,0,2,1}, 'h'},
//{{1,1,0,1,1}, 'i'},
  {{1,2,0,1,2}, 'j'},
  {{1,0,1,2,0}, 'k'},
  {{1,1,1,3,0}, 'l'},
  {{2,0,1,2,1}, 'm'},
  {{2,1,1,2,2}, 'n'},
  {{1,1,1,2,1}, 'o'},
  {{2,1,1,3,1}, 'p'},
  {{2,2,1,3,2}, 'q'},
  {{1,2,1,3,1}, 'r'},
//{{1,1,1,2,1}, 's'},
  {{1,2,1,2,2}, 't'},
  {{1,0,2,2,1}, 'u'},
  {{1,1,2,3,1}, 'v'},
  {{1,2,1,1,3}, 'w'},
  {{2,0,2,2,2}, 'x'},
  {{2,1,2,2,3}, 'y'},
  {{1,1,2,2,2}, 'z'}
};

int main() {
  ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);

  int n;
  cin >> n;
  string s = "";
  loop(n) {
    int a, b, c, d, e;
    cin >> a >> b >> c >> d >> e;
    s += decode[make_tuple(a, b, c, d, e)];
  }
  cout << s << endl;
  return 0;
}


```