#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


/*
  \prod[i>=1] (1 - (1/10)^i)
  = \sum[i] (-1)^i (1/10)^(i(3i+1)/2)
  
  +0 -1 +1 -2: +0 - 1 - 2 + 5
  +2 -3 +3 -4: +7 -12 -15 +22
  
  +100000000100
  -000100100000
  =099899900100
*/

constexpr int ANS[9] = {-1, 0, 9, 8, 9, 9, 0, 1, 0};

Int penta(Int i) {
  return i*(3*i+1)/2;
}

int solve(Int N) {
  // 2k(6k+1)/2 <= N
  const Int k = (-1 + (Int)sqrt(1 + 24.0L * N)) / 12;
  const Int ns[4] = {penta(2*k), penta(-2*k - 1), penta(2*k + 1), penta(-2*k - 2)};
// cerr<<"N = "<<N<<": k = "<<k<<", ns = ";pv(ns,ns+4);
  int cnt = 0;
  for (int i = 0; i < 4; ++i) {
    if (N >= ns[i]) ++cnt;
    if (N >  ns[i]) ++cnt;
  }
  return ANS[cnt];
}

int main() {
  int T;
  for (; ~scanf("%d", &T); ) {
    vector<int> ans(T);
    for (int t = 0; t < T; ++t) {
      Int N;
      scanf("%lld", &N);
      ans[t] = solve(N);
    }
    for (int t = 0; t < T; ++t) {
      if (t) printf(" ");
      printf("%d", ans[t]);
    }
    puts("");
  }
  return 0;
}