#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;

#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
// const int dy[] = {1, 1, 0, -1, -1, -1, 0, 1},
//           dx[] = {0, -1, -1, -1, 0, 1, 1, 1};

struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
    cerr << fixed << setprecision(10);
  }
} iosetup;
/*-------------------------------------------------*/
int main() {
  vector<long long> fib{1, 1};
  while (fib.back() < 1000000000000000) fib.emplace_back(fib[fib.size() - 2] + fib[fib.size() - 1]);
  // for (long long e : fib) cout << e << '\n';
  vector<long long> a(5); REP(i, 5) cin >> a[i];
  reverse(ALL(a));
  for (int i = 4; i >= 0; --i) {
    if (count(ALL(fib), a[i]) == 0) continue;
    int pos = lower_bound(ALL(fib), a[i]) - fib.begin();
    if (a[i] == 1) ++pos;
    bool ok = true;
    for (int j = i - 1; j >= 0; --j) {
      --pos;
      ok &= pos >= 0 && fib[pos] == a[j];
    }
    if (ok) {
      cout << i + 1 << '\n';
      return 0;
    }
  }
  cout << 0 << '\n';
  return 0;
}