1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
#include <iostream>
#include <stdio.h>
#include <cmath>
#include <cstring>
#include <stdlib.h>

using namespace std;

int main()
{
	string s;
	cin >> s;
	long long int m = 1;

	
	char* pEnd;
	long long int n = 0;
	for (int i=s.length()-1; i>=0; i--)
	{
		n = n + m*(s[i]-'0');
		m*=10;
	}
	
	if (m<=1000*1000*1000)
	{
		int mm = m;
		int nn = n;
		int f1=1;
		int f2=1;
		int temp;
		int i=0;
		for (i=0; i<10000*1000; i++)
		{
			temp=(f1+f2)%mm;
			f1=f2;
			f2=temp;
			if (f2 == nn)
			{
				cout << i+3 << endl;
				break;
			}
		}
		if (i == 10000*1000)
			cout << "NIE" << endl;
	}
	else
	{
		long long int f1=1;
		long long int f2=1;
		long long int temp;
		
		int i=0;
		for (i=0; i<10000*1000; i++)
		{
			temp=(f1+f2)%m;
			f1=f2;
			f2=temp;
			if (f2 == n)
			{
				cout << i+3 << endl;
				break;
			}
		}
		if (i == 10000*1000)
			cout << "NIE" << endl;
	}
	
}