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
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <climits>
#include <queue>
#include <vector>

//#define TEST

using namespace std;

typedef unsigned long long int lli;


const lli mmod = 1000000000000000000ll;

lli okres[19] = {0ll, 60ll, 300ll, 1500ll, 15000ll, 150000ll, 1500000ll, 15000000ll, 150000000ll, 1500000000ll, 15000000000ll, 150000000000ll, 1500000000000ll, 15000000000000ll, 150000000000000ll, 1500000000000000ll, 15000000000000000ll, 150000000000000000ll, 1500000000000000000ll};
lli ten[19] = {1ll, 10ll, 100ll, 1000ll, 10000ll, 100000ll, 1000000ll, 10000000ll, 100000000ll, 1000000000ll, 10000000000ll, 100000000000ll, 1000000000000ll, 10000000000000ll, 100000000000000ll, 1000000000000000ll, 10000000000000000ll, 100000000000000000ll, 1000000000000000000ll};

lli mult(lli a, lli b)
{
    lli result = 0;
    if ( b > a ) swap(a,b);
    int i = 0;
    while( b != 0 )
    {
        lli temp = (a*(b%10ll))%mmod;
        for(int j = 0; j < i; j++)
            temp = (temp*10ll)%mmod;
        result = (result+temp)%mmod;
        ++i;
        b/=10ll;
    }
    return result;
}

struct matrix{
    lli a, b, c, d;
    matrix operator* (const matrix& m) const {
        matrix result;
        result.a = (mult(a,m.a)+mult(b,m.c))%mmod;
        result.b = (mult(a,m.b)+mult(b,m.d))%mmod;
        result.c = (mult(c,m.a)+mult(d,m.c))%mmod;
        result.d = (mult(c,m.b)+mult(d,m.d))%mmod;

        return result;
    }

    void print(){
        printf("[%lli %lli %lli %lli]",a,b,c,d);
    }
};

matrix fibMatrix[64];

void fillFibMatrix(){
    fibMatrix[0].a = 1;
    fibMatrix[0].b = 1;
    fibMatrix[0].c = 1;
    fibMatrix[0].d = 0;
//fibMatrix[0].print();
    for(int i= 1; i < 64; ++i){
        fibMatrix[i] = fibMatrix[i-1]*fibMatrix[i-1];
//printf("\n");
//fibMatrix[i].print();
    }
}

int numberOfDigits(lli x);

lli fib(lli k){
    k++;
    matrix res;
    res.a = 1; res.b = 0; res.c = 0; res.d = 1;
    for(int i =0; k!=0; i++, k>>=1)
        if(k % 2) res = res*fibMatrix[i];

    return res.d;
}

int numberOfDigits(lli x) {
    int result= 0;
    while(x!=0)
    {
        result++;
        x/=10;
    }

    return result;
}

char number[20];
int n;
lli val;

struct dupa{
    lli k;
    int cyfr;
    dupa(lli _k, int _cyfr):k(_k),cyfr(_cyfr){}
};

queue<dupa> q;


void find(lli val){
    int numb = numberOfDigits(val);
    lli a = 0, b = 1;
    for(lli i = 2; i < 999999999999999999ll; ++i)
    {
        swap(a,b);
        b += a;
        b = b%mmod;
        if(val == b%ten[numb]){
            printf("%llu\n", i);
            for(lli j = i; j>=60; j-=60)
                printf("k=%llu fib=%llu\n",j, fib(j));
            return;
        }
    }
}



int main(){
    fillFibMatrix();

//printf("%llu", fib(46));return 0;

    gets(number);
    for(n =0; number[n] != 0; ++n);
    val = atoll(number);

    //find(val);

    for(lli i = 0; i < 84; ++i)
    {
        lli fi = fib(i);
        lli f = fi%10;
        if( fi%ten[n] == val && numberOfDigits(fi)>=n ){
#ifdef TEST
                printf("TAK\n");
#else
                printf("%llu", i);
#endif // TEST
            return 0;
        }
        if(f == val%10 && i < 60)
            q.push(dupa(i,1));
    }


    while(!q.empty()){
        dupa current = q.front();
        if(current.cyfr == 18) break;
        //printf("(k=%llu fib=%llu cyfr=%i)\n", current.k, fib(current.k), current.cyfr);
        q.pop();
        for(lli k = current.k; k < okres[current.cyfr+1];k+=okres[current.cyfr]){
            lli fi = fib(k);
            if( k>=84 && fi%ten[n] == val){
#ifdef TEST
                printf("TAK\n");
#else
                printf("%llu", k);
#endif // TEST
                return 0;
            }
            if( fi%ten[current.cyfr+1] == val%ten[current.cyfr+1])
                q.push(dupa(k,current.cyfr+1));
        }
    }

    printf("NIE\n");

    return 0;
}

int main2(){
    while(stdin){
        if ( main2() != 0 ) return 0;
    }

    return 0;
}