#include <bits/stdc++.h>
using namespace std;
const int mxn = 2e5 + 10;
const long long mod = 998244353;
inline int madd(int x, int y) { return (x + y) % mod; }
bool isPrime(long long n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  for (long long i = 5; i * i <= n; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return false;
  return true;
}
const int maxn = 100005;
int a[maxn];
int b[maxn];
long long dp[maxn][2];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long t;
  cin >> t;
  while (t--) {
    long long n, c, j;
    cin >> n;
    for (int i = 0; i < n; i++) {
      int p = n - 3 * i;
      if (p % 2 == 0) {
        c = p / 2;
        j = i;
        break;
      }
    }
    while (j--) cout << '7';
    while (c--) cout << '1';
    cout << endl;
  }
}

### Prompt

Generate a cpp solution to the following problem:

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;
const int mxn = 2e5 + 10;
const long long mod = 998244353;
inline int madd(int x, int y) { return (x + y) % mod; }
bool isPrime(long long n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  for (long long i = 5; i * i <= n; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return false;
  return true;
}
const int maxn = 100005;
int a[maxn];
int b[maxn];
long long dp[maxn][2];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long t;
  cin >> t;
  while (t--) {
    long long n, c, j;
    cin >> n;
    for (int i = 0; i < n; i++) {
      int p = n - 3 * i;
      if (p % 2 == 0) {
        c = p / 2;
        j = i;
        break;
      }
    }
    while (j--) cout << '7';
    while (c--) cout << '1';
    cout << endl;
  }
}

```