#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <complex>
using namespace std;

typedef long long ll;
typedef uint64_t ull;
typedef pair<int, int> P;
constexpr double PI = 3.1415926535897932;   // acos(-1)
constexpr double EPS = 1e-9;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    vector<ll> a(5);
    for(int i = 0; i < 5; ++i)  cin >> a[i];
    vector<ll> dp(76);
    dp[0] = dp[1] = 1;
    for(int i = 2; i <= 75; ++i)    dp[i] = dp[i - 1] + dp[i - 2];
    auto it = lower_bound(dp.begin(), dp.end(), a[4]);
    if(*it != a[4]){
        cout << 0 << endl;
        return 0;
    }
    int pos = it - dp.begin();
    if(dp[pos] == 1){
        if(a[3] != 1 && a[3] != 2){
            cout << 1 << endl;
            return 0;
        }
        if(a[3] == 2){
            int ans = 2;
            pos += 2;
            for(int i = 2; i >= 0; --i){
                if(dp[++pos] != a[i])   break;
                ++ans;
            }
            cout << ans << endl;
            return 0;
        }
    }
    int ans = 1;
    for(int i = 3; i >= 0; --i){
        if(dp[++pos] != a[i])   break;
        ++ans;
    }
    cout << ans << endl;
}