#include <bits/stdc++.h>
using namespace std;
const int dx44[5] = {0, -1, -1, 1, 1};
const int dy44[5] = {0, -1, 1, -1, 1};
const int dx4[5] = {0, 1, 0, -1};
const int dy4[5] = {1, 0, -1, 0};
const int dx8[9] = {0, -1, 0, 1, 0, 1, 1, -1, -1};
const int dy8[9] = {0, 0, 1, 0, -1, 1, -1, 1, -1};
const int dx82[9] = {0, -1, -1, 1, 1, 2, 2, -2, -2};
const int dy82[9] = {0, 2, -2, 2, -2, 1, -1, 1, -1};
const int maxn = 5e5 + 100;
const double PI = acos(-1.0);
const long long mod = 1e9 + 7;
const long long mod1 = 1e8 + 7;
const long long mod2 = 1e9 + 7;
long long po(long long a, long long b, long long mod) {
  long long res = 1;
  a %= mod;
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
long long gcd(long long a, long long b) {
  if (a == 0) {
    return b;
  } else {
    return gcd(b % a, a);
  }
}
void extgcd(long long a, long long b, long long &d, long long &x,
            long long &y) {
  if (!b) {
    d = a;
    x = 1;
    y = 0;
  } else {
    extgcd(b, a % b, d, y, x);
    y -= x * (a / b);
  }
}
long long inverse(long long a, long long n) {
  long long d, x, y;
  extgcd(a, n, d, x, y);
  return d == 1 ? (x + n) % n : -1;
}
void YES() {
  puts("YES");
  exit(0);
}
void Yes() { puts("Yes"); }
void NO() {
  puts("NO");
  exit(0);
}
void No() { puts("No"); }
void one() {
  puts("-1");
  exit(0);
}
long long n;
long long f[100];
long long dp[100][2];
void solve() {
  f[1] = 1;
  f[2] = 2;
  for (int i = 3; i <= 88; i++) {
    f[i] = f[i - 1] + f[i - 2];
  }
  scanf("%lld", &(n));
  vector<int> s;
  for (int i = 88; i >= 1; i--) {
    if (n >= f[i]) {
      n -= f[i];
      s.push_back(i);
    }
  }
  reverse(s.begin(), s.end());
  dp[0][1] = 1;
  dp[0][0] = (s[0] - 1) / 2;
  for (int i = 1; i < s.size(); i++) {
    dp[i][1] = dp[i - 1][0] + dp[i - 1][1];
    dp[i][0] = (s[i] - s[i - 1]) / 2 * dp[i - 1][0] +
               (s[i] - s[i - 1] - 1) / 2 * dp[i - 1][1];
  }
  printf("%lld\n", dp[s.size() - 1][0] + dp[s.size() - 1][1]);
}
int main() {
  int t;
  scanf("%d", &(t));
  while (t--) solve();
  return 0;
}
