#include <bits/stdc++.h>
using namespace std;
using ll = long long;
map<ll, ll> mp1, mp;
vector<pair<ll, pair<ll, ll> > > vpp1;
vector<pair<ll, ll> > vpp, vp1;
vector<ll> v, v1, v2, fin;
map<pair<ll, ll>, bool> mbb;
map<ll, bool> mb, mb1;
ll a, b, c, n, d, e, f, ta, sum = 0, cnt = 0, m, l, req, sz, maxi, k, q,
                            ans = 0, x, y;
priority_queue<ll> pq;
string s;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> ta;
  for (ll test = 0; test < ta; test++) {
    cin >> n;
    s.clear();
    while (n) {
      if (n == 3) {
        n = 0;
        s += '7';
      } else {
        n -= 2;
        s += '1';
      }
    }
    reverse(s.begin(), s.end());
    cout << s << endl;
  }
  return 0;
}

### Prompt

Develop a solution in cpp to the problem described below:

You have a large electronic screen which can display up to 998244353 decimal digits. The digits are displayed in the same way as on different electronic alarm clocks: each place for a digit consists of 7 segments which can be turned on and off to compose different digits. The following picture describes how you can display all 10 decimal digits:

<image>

As you can see, different digits may require different number of segments to be turned on. For example, if you want to display 1, you have to turn on 2 segments of the screen, and if you want to display 8, all 7 segments of some place to display a digit should be turned on.

You want to display a really large integer on the screen. Unfortunately, the screen is bugged: no more than n segments can be turned on simultaneously. So now you wonder what is the greatest integer that can be displayed by turning on no more than n segments.

Your program should be able to process t different test cases.

Input

The first line contains one integer t (1 ≤ t ≤ 100) — the number of test cases in the input.

Then the test cases follow, each of them is represented by a separate line containing one integer n (2 ≤ n ≤ 10^5) — the maximum number of segments that can be turned on in the corresponding testcase.

It is guaranteed that the sum of n over all test cases in the input does not exceed 10^5.

Output

For each test case, print the greatest integer that can be displayed by turning on no more than n segments of the screen. Note that the answer may not fit in the standard 32-bit or 64-bit integral data type.

Example

Input


2
3
4


Output


7
11

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
map<ll, ll> mp1, mp;
vector<pair<ll, pair<ll, ll> > > vpp1;
vector<pair<ll, ll> > vpp, vp1;
vector<ll> v, v1, v2, fin;
map<pair<ll, ll>, bool> mbb;
map<ll, bool> mb, mb1;
ll a, b, c, n, d, e, f, ta, sum = 0, cnt = 0, m, l, req, sz, maxi, k, q,
                            ans = 0, x, y;
priority_queue<ll> pq;
string s;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> ta;
  for (ll test = 0; test < ta; test++) {
    cin >> n;
    s.clear();
    while (n) {
      if (n == 3) {
        n = 0;
        s += '7';
      } else {
        n -= 2;
        s += '1';
      }
    }
    reverse(s.begin(), s.end());
    cout << s << endl;
  }
  return 0;
}

```