/*		Fibonacci [A]
 *		Marek Iwaniuk
 *		O(kosmos)
 */

//#include "stdafx.h"
#include <iostream>
using namespace std;

class Fibonacci {
	private:
		long long n, modulo;
		long long last, next;

		long long GetModulo(long long n) {
			long long mod = 1;
			while (n > 0) {
				mod *= 10;
				n /= 10;
			}
			return mod;
		}
	public:
		Fibonacci() {
			cin >> n;
			last = 1;
			next = 1;
			modulo = GetModulo(n);
			for (int i = 1; i <= 20000000; i++) {
				long long num = (last + next) % modulo;
				long long tmp = last;
				last += next % modulo;
				last %= modulo;
				next = tmp % modulo;
				if (num == n) {
					cout << i + 2 << endl;
					return;
				}
			}
			cout << "NIE" << endl;
		}
};

int main() {
	ios_base::sync_with_stdio(0);
	Fibonacci *New = new Fibonacci();
	return 0;
}