// yuki 954 Result
// 2019.12.18 bal4u

#include <stdio.h>

typedef long long ll;

int getchar_unlocked(void);
#define gc() getchar_unlocked()

ll in() {   // 非負整数の入力
	ll n = 0;
	int c = gc();
	do n = 10 * n + (c & 0xf); while ((c = gc()) >= '0');
	return n;
}

#define MAX 73 // f[73]=1304969544928657
ll f[MAX+5]; // f[0]=1, f[1]=1, f[2]=2, f[3]=3

void fibonacci(int a0, int a1) {
	int i;
	f[0] = a0, f[1] = a1;
	for (i = 2; i <= MAX; ++i) f[i] = f[i-2]+f[i-1];
}

int bsch(ll x) {
	int m, l = 0, r = MAX;
    while (l < r) {
        m = (l + r) >> 1;
		if (f[m] == x) return m;
        if (f[m] < x) l = m + 1; else r = m;
    }
	return f[l] == x? l: -1;
}

int main()
{
	int i, j;
	ll a[5];
	
	fibonacci(1, 1);
	for (i = 4; i >= 0; --i) a[i] = in();
	i = 0;
	if (a[0] == 1) {
		j = 1;
		if (a[1] == 1) i = 1;
	} else if ((j = bsch(a[0])) < 0) { puts("0"); return 0; }
	while (++i < 5) {
		if (a[i] != f[++j]) break;
	}
	printf("%d\n", i);
	return 0;
}