#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
const int MAXN = 100010;
const int INF = 0x3f3f3f3f;
long long a[MAXN];
int main()
{
    a[1] = 1;
    a[2] = 2;
    for(int i = 3; i <= 105; i++)
    {
        a[i] = a[i-1]+a[i-2];
    }
    int T,cnt;
    long long N;
    scanf("%d",&T);
    while(T--)
    {
        cnt = 0;
        cin >> N;
        for(int i = 1; i <= 100; i++)
        {
            if(N < a[i])
            {
                break;
            }
            N -= a[i];
            cnt++;
        }
        cout << cnt << endl;
    }
    return 0;
}