#include <bits/stdc++.h>

int main() {
	int64_t m;
	std::cin >> m;
	if (m == 1) {
		std::cout << 1 << '\n';
		return 0;
	}
	std::map<int64_t, int> f;
	std::vector<int64_t> fib = {1, 1};
	while (fib.back() < m) {
		int t = fib.size();
		fib.push_back(fib[t - 1] + fib[t - 2]);
	}
	auto dfs = [&](auto &self, int64_t prod) -> int {
		if (f.count(prod))
			return f[prod];
		if (prod == 1)
			return 0;
		int ans = 0x3f3f3f3f;
		for (int i = 2; i < fib.size(); ++i) {
			if (prod % fib[i] == 0) {
				ans = std::min(ans, self(self, prod / fib[i]) + i + 1);
			}	
		}
		return f[prod] = ans;
	};
	int ans = dfs(dfs, m);
	if (ans == 0x3f3f3f3f) std::cout << "NIE" << '\n';
	else std::cout << ans - 1 << '\n';
}