#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	vector<ll> A(5);
	REP(i, 5) cin >> A[i];
	
	vector<ll> fib;
	fib.emplace_back(1);
	fib.emplace_back(1);
	while (fib.back() < longINF) fib.emplace_back(fib.back() + *----fib.end());
	int ans = 0;
	reverse(ALL(A));
	int p = 0;
	for (; p < fib.size(); ++p) if (fib[p] == A[0]) { ans = 1; break; }
	if (A[1] != 1) chmax(p, 1);
	if (ans > 0) {
		FOR(i, 1, 5) {
			if (p + i < fib.size() && A[i] == fib[p + i]) ++ans;
			else break;
		}
	}
	cout << ans << endl;
}