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

#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define FOR(i, a, b) for (int i = (a); i<(b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i>=(a); --i)
#define MP make_pair
#define PB push_back
#define F first
#define S second

typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;

struct Long {
	string s;
	Long() {}
	Long(const string& _s): s(_s) {}
	Long operator+(const Long& n) {
		const string& t = n.s;
		string res;
		int c = 0;
		FOR(i, 0, max(SZ(s), SZ(t))) {
			int d1 = i >= SZ(s) ? 0 : s[SZ(s) - 1 - i] - '0', d2 = i >= SZ(t) ? 0 : t[SZ(t) - 1 - i] - '0';
			int cur = d1 + d2 + c;
			res += char(cur % 10 + '0');
			c = cur >= 10;
		}
		if (c) {
			res += '1';
		}
		reverse(ALL(res));
		return res;
	}
};

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	Long f0("1"), f1("1");
	unordered_map<string, vector<int>> queries;
	int tc;
	cin >> tc;
	FOR(t, 0, tc) {
		string s;
		cin >> s;
		queries[s].push_back(t);
	}
	vector<int> ans(tc, -1);
	FOR(i, 1, 100000) {
		swap(f0, f1);
		f1 = f0 + f1;
		if (SZ(f1.s) > 74) {
			f0.s.pop_back();
			f1.s.pop_back();
		}
		string pref;
		FOR(j, 0, min(40, SZ(f0.s))) {
			pref += f0.s[j];
			if (queries.count(pref)) {
				for (int idx : queries[pref]) {
					ans[idx] = i;
				}
				queries.erase(pref);
			}
		}
	}
	FOR(t, 0, tc) {
		cout << "Case #" << t + 1 << ": " << (ans[t] == 1 ? 0 : ans[t]) << "\n";
	}
	cerr << (double)clock() / CLOCKS_PER_SEC << endl;
	return 0;
}