#include <bits/stdc++.h>
using namespace std;
const long long N = 101, M = (long long)1e18;
long long arr[N], ind = 2, f[N], g[N];
void p_f() {
  arr[1] = 1;
  arr[2] = 2;
  while (arr[ind] <= M) {
    ind++;
    arr[ind] = arr[ind - 1] + arr[ind - 2];
  }
}
long long get_ans(long long n) {
  vector<int> v;
  while (n) {
    int id = lower_bound(arr, arr + ind, n) - arr;
    if (arr[id] == n) {
      v.push_back(id);
      n = 0;
    } else {
      id--;
      v.push_back(id);
      n -= arr[id];
    }
  }
  v.push_back(0);
  reverse(v.begin(), v.end());
  memset(f, 0, sizeof f);
  memset(g, 0, sizeof g);
  int sz = v.size();
  g[0] = 1;
  f[0] = 0;
  for (int i = 1; i < sz; i++) {
    g[i] = g[i - 1] + f[i - 1];
    f[i] = g[i - 1] * ((v[i] - v[i - 1] - 1) / 2) +
           f[i - 1] * ((v[i] - v[i - 1]) / 2);
  }
  return f[sz - 1] + g[sz - 1];
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  p_f();
  int t;
  cin >> t;
  while (t--) {
    long long n;
    cin >> n;
    cout << get_ans(n) << '\n';
  }
}
