#include <bits/stdc++.h>
using namespace std;
template <class T1>
void deb(T1 e1) {
  cout << e1 << endl;
}
template <class T1, class T2>
void deb(T1 e1, T2 e2) {
  cout << e1 << " " << e2 << endl;
}
template <class T1, class T2, class T3>
void deb(T1 e1, T2 e2, T3 e3) {
  cout << e1 << " " << e2 << " " << e3 << endl;
}
template <class T1, class T2, class T3, class T4>
void deb(T1 e1, T2 e2, T3 e3, T4 e4) {
  cout << e1 << " " << e2 << " " << e3 << " " << e4 << endl;
}
template <class T1, class T2, class T3, class T4, class T5>
void deb(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5) {
  cout << e1 << " " << e2 << " " << e3 << " " << e4 << " " << e5 << endl;
}
template <class T1, class T2, class T3, class T4, class T5, class T6>
void deb(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5, T6 e6) {
  cout << e1 << " " << e2 << " " << e3 << " " << e4 << " " << e5 << " " << e6
       << endl;
}
int Set(int n, int pos) { return n = n | (1 << pos); }
bool check(int n, int pos) { return (bool)(n & (1LL << pos)); }
int reset(int n, int pos) { return n = n & ~(1 << pos); }
int dx[] = {0, 0, 1, -1};
int dy[] = {-1, 1, 0, 0};
long long dp[95], mydp[95][3];
double dbdp[95];
int valid[95];
double lm = 1e18;
long long dp_func(int pos, int b) {
  if (pos == 0) {
    return 1;
  }
  if (mydp[pos][b] != -1) return mydp[pos][b];
  long long ret = 0;
  if (b == 0) {
    if (valid[pos] && pos > 2) ret += dp_func(pos - 2, 1);
    ret += dp_func(pos - 1, 0);
    return mydp[pos][b] = ret;
  }
  if (valid[pos] == 0) {
    ret += dp_func(pos - 1, 0);
    if (pos > 2 && valid[pos - 1] == 0) ret += dp_func(pos - 2, 1);
  }
  if (valid[pos] && pos > 2) {
    ret += dp_func(pos - 2, 1);
  }
  return mydp[pos][b] = ret;
}
int main() {
  dp[1] = 1;
  dp[2] = 2;
  dbdp[1] = 1;
  dbdp[2] = 2;
  int cnt, i;
  for (i = 3;; i++) {
    dbdp[i] = dbdp[i - 1] + dbdp[i - 2];
    dp[i] = dp[i - 1] + dp[i - 2];
    if (dbdp[i] > lm) break;
  }
  cnt = i - 1;
  int j, k, l;
  cin >> l;
  while (l--) {
    long long n;
    scanf("%lld", &n);
    memset(valid, 0, sizeof valid);
    for (int i = cnt; i >= 1; i--) {
      if (dp[i] <= n) {
        n -= dp[i];
        valid[i] = 1;
      }
    }
    memset(mydp, -1, sizeof mydp);
    long long ans = dp_func(cnt, 0);
    cout << ans << endl;
  }
}
