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
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <list>
#include <ctime>
#include <sstream>
#include <queue>
#include <stack>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef unsigned long long ll;
typedef short int sint;
#define FOR(x, b, e) for(int x=(b); x<=(e); ++x)
#define FORD(x, b, e) for(int x=((int)(b))-1; x>=(e); --x)
#define REP(x, n) for(int x=0; x<(n); ++x)
#define ALL(c) c.begin(),c.end()
#define SIZE(x) ((int)((x).size()))
#define PB push_back
#define ST first
#define ND second
#define mp(x,y) make_pair(x,y)
#define DEBUG 1
#define debug(x) {if (DEBUG)cerr <<#x <<" = " <<x <<endl; }
#define debugv(x) {if (DEBUG) {cerr <<#x <<" = "; FOREACH(it, (x)) cerr <<*it <<", "; cout <<endl; }}
#define REMAX(a,b) (a)=max((a),(b));
#define REMIN(a,b) (a)=min((a),(b));
#define wez(n) int (n); scanf("%d",&(n));
#define wez2(n,m) int (n),(m); scanf("%d %d",&(n),&(m));

const int N = 20;
char wz[N];
int n;
ll c;
const int R = 2;
ll pisano[N];
ll p;

ll mulmod(ll a, ll b) {
    ll rv = 0;
    while (b) {
        if (b&1) {
        	rv += a;
            if (rv >= p) {
            	rv -= p;
            }
        }
        a += a;
        if (a >= p) {
        	a -= p;
        }
        b >>= 1;
   	}
    return rv;
}

struct Mat {
      ll t[R][R];
      Mat() {
              REP(i,R) REP(j,R) if(i==j) t[i][j] = 1; else t[i][j] = 0;
      }
      Mat(int x) {
              t[0][0] = t[1][0] = t[0][1] = 1;
              t[1][1] = 0;
      }
};

Mat operator*(const Mat &a, const Mat &b){
	Mat wyn;
	REP(i,R) {
		REP(j,R) {
			wyn.t[i][j] = 0;
			REP(k,R) {
				wyn.t[i][j] += mulmod(a.t[i][k], b.t[k][j]);
			}
			wyn.t[i][j] %= p;
		}
	}
	return wyn;
}

Mat pot(Mat a, ll potega){
      Mat wyn, pom = a;
      while(potega) {
              if(potega & 1) wyn = wyn * pom;
              potega >>= 1;
              pom = pom * pom;
      }
      return wyn;
}

const int MAXF = 87;
ll fib[MAXF + 1];

bool rowne(ll ind, ll reszta) {
	return (reszta % p) == (c % p);
}

int main() {
	fib[1] = 1;
	FOR(i, 2, MAXF) {
		fib[i] = fib[i-1] + fib[i - 2];
	}
	scanf("%s", wz);
	c = atoll(wz);
	n = strlen(wz);
	set<ll> s; // potencjalne
	p = 10;
	pii fi = mp(0, 1);
	if (c % p == 0) {
		s.insert(0);
	} else if (c % p == 1) {
		s.insert(1);
	}
	pisano[1] = 60;
	pisano[2] = 300;
	pisano[3] = 1500;
	FOR(i, 4, n) {
		pisano[i] = pisano[i-1] * 10;
	}
	FOR(i, 2, pisano[1] - 1) {
		fi = mp(fi.ND, (fi.ND + fi.ST) % p);
		if ((fi.ND % p) == (c % p)) {
			s.insert(i);
		}
	}
	// s - wyniki dla c % 10
	FOR(qq, 2, n) {
		if (s.empty()) {
			break;
		}
		// printf(" dla qq: %d\n", qq);
		p *= 10;
		ll period = pisano[qq];
		set<ll> ns;
		for (ll kandydat : s) {
			// printf("kandydat: %llu\n", kandydat);
			REP(i, 11) {
				ll potega = kandydat + i * pisano[qq - 1];
				Mat pier = pot(Mat(1), potega);
				if (rowne(potega, pier.t[0][1])) {
					// printf("  produkuj: %llu\n", potega);
					ns.insert(potega);
				}
			}
		}
		s = ns;
	}
	if (s.empty()) {
		printf("NIE\n");
	} else {
		auto q = s.begin();
		//for (auto el : s) { printf("%llu ", el); } printf("\n");
		//printf("%d %d %d\n", wz[0] == '0', *q <= MAXF, (p + c) > fib[*q]);
		while ((wz[0] == '0') && (*q <= MAXF) && ((p + c) > fib[*q])) {
			++q;
		}
		printf("%llu\n", *q);
	}
	return 0;
}