#include using namespace std; using ll = long long; using VI = vector; using VL = vector; using PII = std::pair; using PLL = std::pair; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--) #define rep2(i, s, n) for (int i = (s); i < (int)(n); i++) #define allpt(v) (v).begin(), (v).end() #define allpt_r(v) (v).rbegin(), (v).rend() const int mod = 1e9 + 7; const string wsp = " "; const string tb = "\t"; const string rt = "\n"; template void show1dvec(vector v) { int n = v.size() - 1; rep(i, n) cout << v[i] << wsp; cout << v[n] << rt; return; } template void show2dvec(vector> v) { int n = v.size(); rep(i, n) show1dvec(v[i]); } int main() { #ifdef DEBUG cout << "DEBUG MODE" << endl; ifstream in("input.txt"); //for debug cin.rdbuf(in.rdbuf()); //for debug #endif VL v(5), v2(5, -2), fiv(74); fiv[0] = fiv[1] = 1; rep(i, 72) { fiv[i + 2] = fiv[i] + fiv[i + 1]; if (fiv[i] > 1e15) { cout << i << rt; break; } } repr(i, 5) cin >> v[i]; rep(i, 5) { rep2(j, 1, 74) { if (fiv[j] == v[i]) v2[i] = j; } } rep(i, 4) if (v2[i] == 1 && v2[i+1] == 1) v2[i] = 0; int k, maxk, ans = 0; k = maxk = 0; if (*max_element(allpt(v2)) != -2) ans++; rep(i, 4) { if (v2[i] + 1 == v2[i+1]) k++; else k = 0; maxk = max(k, maxk); } cout << ans + maxk << rt; return 0; }