#include<algorithm>
#include<vector>
#include<iostream>
using namespace std;

int count_fib(vector<int> &v) {
    int max_v = 0;

    for(int i=0; i<v.size(); i++) {
        if(max_v < v[i]) {
            max_v = v[i];
        }
    }


    int a = 1;
    int b = 0;
    int ans = 0;
    vector<int> fib_v;

    for(int i=0; i<max_v; i++) {
        ans = a + b;
        fib_v.push_back(ans);
        a = b;
        b = ans;
    }

    vector<int> count_v;
    int counter = 0;
    int n = 0;
    for(int i=0; i<v.size(); i++) {
        for(int j=fib_v.size(); j>0; j--) {
            if(v[i] == fib_v[j]) {
                n = i;
                for(int k=j; k>0; k--) {
                    if(v[n] == fib_v[k]) {
                        n--;
                    } else if(n!=0){
                        continue;
                    } else {
                        goto exit;
                    }
                }
            }
        }
    }


    exit:

    return counter;
}

int main() {

    int N = 5;
    vector<int> v;
    int x;
    for(int i=0; i<N; i++) {
        cin >> x;
        v.push_back(x);
    }

    cout << count_fib(v);

    return 0;
}