#include <bits/stdc++.h>

using namespace std;

#define int long long

int f[105], n, tt;
main() {
  //freopen(".inp", "r", stdin);
  //freopen(".out", "w", stdout);
  ios_base::sync_with_stdio(0);
  cin.tie(nullptr);
  f[1] = f[2] = 1;
  for (int i = 3; i <= 100; ++i)
  {
    f[i] = f[i - 1] + f[i - 2];
  }
  cin >> tt;
  while (tt--){
    int n;
    cin >> n;
    bool check = false;
    for (int i = 1; i <= 100; ++i)
    {
      if (n == f[i]){
        check = true;
        cout << i;
        break;
      }
    }
    if (!check) cout << "-1";
    cout << '\n';
  }
  return 0;
}
    

#include<bits/stdc++.h>
using namespace std;
#define ll long long

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    ll fib[1002] = {};
    fib[1] = 1; fib[2] = 1;
    ll t,x; cin>>t;
    
    for (int i = 3 ; i<=1001 ; i++) fib[i] = fib[i-1]+fib[i-2];
    
    while (t--){
        ll flag = 0;
        cin>>x;
        for (int i = 0 ; i<=1001 ; i++){
            if (x == fib[i]){
                cout<<i<<endl;
                flag = 1;
                break;
            }
        }
        if (flag == 0) cout<<-1<<endl;
    }
    return 0;
}