import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  enum L = 100;
  auto fib = new BigInt[L];
  fib[0] = 1;
  fib[1] = 1;
  foreach (l; 2 .. L) {
    fib[l] = fib[l - 1] + fib[l - 2];
  }
  
  try {
    for (; ; ) {
      enum N = 5;
      auto A = new BigInt[N];
      foreach (i; 0 .. N) {
        A[i] = readLong();
      }
      
      int ans;
      foreach (k; 1 .. N + 1) {
        foreach (l; 0 .. L - k) {
          bool ok = true;
          foreach (i; 0 .. k) {
            ok = ok && (fib[l + i] == A[N - 1 - i]);
          }
          if (ok) {
            chmax(ans, k);
          }
        }
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}