The Bubble Cup hypothesis stood unsolved for 130 years. Who ever proves the hypothesis will be regarded as one of the greatest mathematicians of our time! A famous mathematician Jerry Mao managed to reduce the hypothesis to this problem:

Given a number m, how many polynomials P with coefficients in set {\{0,1,2,3,4,5,6,7\}} have: P(2)=m?

Help Jerry Mao solve the long standing problem!

Input

The first line contains a single integer t (1 ≤ t ≤ 5⋅ 10^5) - number of test cases.

On next line there are t numbers, m_i (1 ≤ m_i ≤ 10^{18}) - meaning that in case i you should solve for number m_i.

Output

For each test case i, print the answer on separate lines: number of polynomials P as described in statement such that P(2)=m_i, modulo 10^9 + 7.

Example

Input


2
2 4


Output


2
4

Note

In first case, for m=2, polynomials that satisfy the constraint are x and 2.

In second case, for m=4, polynomials that satisfy the constraint are x^2, x + 2, 2x and 4.
#include <bits/stdc++.h>
using namespace std;
const int N = 60, M = 7, MOD = 1e9 + 7;
int dp[2][M];
inline int add(int a, int b) {
  int ret = a + b;
  if (ret >= MOD) ret -= MOD;
  return ret;
}
void solve() {
  memset(dp, 0, sizeof dp);
  long long n;
  scanf("%lld", &n);
  for (int i = 0; i < M; i++) dp[0][i] = 1;
  for (int i = N - 1; i >= 0; i--) {
    bool hv = n & (1LL << i);
    int d = i & 1;
    for (int j = 0; j < M; j++) {
      int r = j - hv + 7;
      int l = j - hv;
      r /= 2;
      l = (l + 1) / 2;
      if (r >= M) r = M - 1;
      dp[d][j] = add(dp[1 - d][r], MOD - (l > 0 ? dp[1 - d][l - 1] : 0));
      if (j) dp[d][j] = add(dp[d][j], dp[d][j - 1]);
    }
  }
  printf("%d\n", dp[0][0]);
}
signed main() {
  int t;
  scanf("%d", &t);
  while (t--) solve();
}
