#include <bits/stdc++.h>
using namespace std;
int64_t mod = 1e9 + 7;
int64_t mod1 = 1e9 + 5;
int64_t power(int64_t a, int64_t b) {
  if (b == 0)
    return 1;
  else if (b % 2 == 0)
    return power(((((a) % mod) * ((a) % mod)) % mod), b / 2) % mod;
  else
    return (((a) % mod) *
            (power(((((a) % mod) * ((a) % mod)) % mod), b / 2) % mod)) %
           mod;
}
inline int64_t inverse(int64_t a, int64_t md) {
  a %= md;
  if (a < 0) a += md;
  int64_t b = md, u = 0, v = 1;
  while (a) {
    int64_t t = b / a;
    b -= t * a;
    swap(a, b);
    u -= t * v;
    swap(u, v);
  }
  assert(b == 1);
  if (u < 0) u += md;
  return u;
}
const int64_t ce = 1e9 + 7;
int64_t fast_mod(int64_t input) { return input < ce ? input : input % ce; }
int64_t fib[91];
vector<int64_t> v;
int64_t n;
int64_t dp[91][2][2];
int64_t solve(int64_t i, int64_t c1, int64_t c2) {
  if (i >= n) {
    if (c1 == 1 or c2 == 1) return 0;
    return 1;
  }
  int64_t &res = dp[i][c1][c2];
  if (res != -1) return res;
  res = 0;
  if (c1 == 1 and c2 == 1) {
    if (v[i] == 0) {
      res += solve(i + 1, 1, 0);
    }
  }
  if (c1 == 1 and c2 == 0) {
    if (v[i] == 0) {
      res += solve(i + 1, 0, 0);
      res += solve(i + 1, 1, 1);
    } else {
      res += solve(i + 1, 1, 1);
    }
  }
  if (c1 == 0 and c2 == 0) {
    if (v[i] == 0) {
      res += solve(i + 1, 0, 0);
    } else {
      res += solve(i + 1, 0, 0);
      res += solve(i + 1, 1, 1);
    }
  }
  if (c1 == 0 and c2 == 1) {
    if (v[i] == 0) {
      res += solve(i + 1, 1, 0);
    } else {
      res += solve(i + 1, 1, 0);
    }
  }
  return res;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  fib[0] = 0, fib[1] = 1, fib[2] = 2;
  for (int64_t i = 3; i <= 90; i++) {
    fib[i] = fib[i - 1] + fib[i - 2];
  }
  int64_t t;
  cin >> t;
  while (t--) {
    int64_t x;
    cin >> x;
    v.clear();
    for (int64_t i = 90; i >= 1; i--) {
      if (x >= fib[i]) {
        x -= fib[i];
        v.push_back(1);
      } else {
        if ((int64_t)v.size() != 0) v.push_back(0);
      }
    }
    assert(x == 0);
    n = v.size();
    memset(dp, -1, sizeof(dp));
    cout << solve(0, 0, 0) << '\n';
  }
}
