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
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
using namespace std;

//działa dobrze do ok. 11 cyfr

vector<long long> v;

int tab[32]; 
string s;

struct Mat {
    long long unsigned a11, a12, a21, a22;
    Mat(){ }
    Mat(long long unsigned a11, long long unsigned a12, long long unsigned a21, long long unsigned a22) : 
        a11(a11), a12(a12), a21(a21), a22(a22) { }
} A(1,1,1,0);

string rep_bin(long long unsigned x) {
    string res = "";
    while(x > 0) {
        if(x % 2) res = "1" + res;
        else res = "0" + res;
        x /= 2;
    }
    return res;
}

long long unsigned mnoz(long long a, long long b) {
    long long unsigned m = 1000000000ULL;
    long long unsigned a1 = a % m, a2 = a/m;
    long long unsigned b1 = b % m, b2 = b/m;
    long long unsigned result = a1 * b1;
    long long unsigned tmp = (a2 * b1);
    result += (tmp % m) * m;
    tmp = (a1 * b2);
    result += (tmp % m) * m;
    return result;
}


Mat multiply(Mat &el1, Mat &el2, long long unsigned m) {
    Mat res;
    el1.a11 %= m;
    el1.a12 %= m;
    el1.a21 %= m;
    el1.a22 %= m;
    
    el2.a11 %= m;
    el2.a12 %= m;
    el2.a21 %= m;
    el2.a22 %= m;
    
    //z sumą nie ma problemu bo jest najwyżej 19-o cyfrowa, czyt wchodzi w long longa.
    res.a11 = mnoz(el1.a11, el2.a11) % m + mnoz(el1.a12, el2.a21) % m;
    res.a12 = mnoz(el1.a11, el2.a12) % m + mnoz(el1.a12, el2.a22) % m;
    res.a21 = mnoz(el1.a21, el2.a11) % m + mnoz(el1.a22, el2.a21) % m;
    res.a22 = mnoz(el1.a21, el2.a12) % m + mnoz(el1.a22, el2.a22) % m;
    
    
    res.a11 %= m;
    res.a12 %= m;
    res.a21 %= m;
    res.a22 %= m;
    
    return res;
}


long long unsigned num(string str) {
    long long res = 0;
    for(unsigned int i = 0; i < str.size(); ++i) {
        res *= 10;
        res += (str[i] - '0');
    }
    return res;
}

bool brut(string s) {
    
        long long unsigned pattern = num(s);
        int n = s.size();
    
        long long unsigned d = 1 << n;
        long long unsigned d2 = 1;
        for(int i = 0; i < n; ++i) d2 *= 5;
        long long unsigned d3 = 1;
        for(int i = 0; i < n; ++i) d3 *= 10;
        
        set<int> numerki;
        
        long long unsigned a = 0;
        long long unsigned b = 1;
        int n_iter = 3 * d / 2;
        for(int i = 0; i < n_iter; ++i) {
            if(a % d == pattern % d) {
                numerki.insert(i);
            }
            a = (a+b) % d;
            swap(a, b);
        }
        
        a = 0;
        b = 1;
        bool koniec = false;
        //  ~long long result;
        
        long long unsigned n_iter2 = 4 * d2;
        for(unsigned long long i = 0; i < n_iter2; ++i) {
                if(a % d2 == pattern % d2) {
                    long long unsigned j = i;
                        for (long long unsigned ii = 0; ii <= d/2; ++ii) {
                        if (numerki.find(j % n_iter) != numerki.end()) {
                            koniec = true;
                            //  ~result = j;
                            break;
                        } 
                        j += n_iter2;
                    }
                }
                if(koniec) break;
                a = (a+b) % d2;
                swap(a, b);
        }
        if(koniec) { 
            return true; 
            //  ~printf("%lld\n", result);
        }
        else {
            printf("NIE\n");
            return false;
        }
}

bool flaga = false;

pair<vector<long long unsigned>, long long unsigned> ustaw2(string s, long long unsigned baza, long long unsigned krok) {
    vector<long long unsigned> res;
    long long unsigned k2; 
    long long unsigned pattern = num(s);
    int n = s.size();
    
    //  ~long long unsigned d1 = 1 << n;
    long long unsigned d2 = 1;
    for(int i = 0; i < n; ++i) d2 *= 5;
    long long unsigned d3 = 1;
    for(int i = 0; i < n; ++i) d3 *= 10;
    
    long long unsigned mm = 15 * d3;
    if(s.size() == 18) mm = 18446744073709551615ULL;
    mm /= krok;
    
    k2 = d3/100;
    k2 *= 75;
    if(d3 <= 100) k2 = 150;
    if(d3 <= 10) k2 = 15; 
    
    for(long long unsigned i = baza, iter = 0; iter < mm ; i += krok, iter++) {
        string str = rep_bin(i);
        Mat id = Mat(1,0,0,1);
        for(unsigned j = 0; j < str.size(); ++j) {
            id = multiply(id, id, d3);
            if(str[j]=='1') id = multiply(id, A, d3);
        }
        if(id.a12 == pattern) {
                flaga = true;
                res.push_back(i);
            } 
    }
    return make_pair(res, k2);
}

void heura(string s) {
        pair<long long unsigned, long long unsigned > p;
        p = make_pair(0, 1);
        pair<vector<long long unsigned>, long long unsigned> result, tmp;
        for(int i = 1; 3 * i < (int) s.size() + 3; ++i) {
            int d = s.size() - 3 * i;
            int dl = s.size();
            dl = min(3*i, dl);
            flaga = false;
            tmp = ustaw2(s.substr(max(d, 0), dl), p.first, p.second);
            if(flaga) {
                result = tmp;
            }
            else {
                while(!flaga) {
                    if(result.first.size() > 0) {
                        result.first.pop_back();
                        p = make_pair(result.first.back(), result.second);
                        tmp = ustaw2(s.substr(max(d, 0), dl), p.first, p.second);
                        result.first.pop_back();
                    }
                    else {
                        printf("SOMETHIHNG WENT WRONG\n");
                    }
                }
                result = tmp;
            }
            p = make_pair(result.first.back(), result.second);
        }
        cout << p.first << endl;
}

int main() {
    long long unsigned a = 0, b = 1;
    long long unsigned pattern;
    
    cin >> s;
    pattern = num(s);
        
    for(int i = 0; i < 100; ++i) {
        tab[a] = 1;
        a = (a+b) % 32;
        swap(a, b);
    }
    
    
    if(tab[pattern % 32] == 0 && s.size() >= 5) printf("NIE\n");
    else {
        if(s.size() <= 5) {
            if(brut(s)) heura(s);
        }
        else {
            heura(s);
        }
    }
    
return 0;
}