#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
using namespace std;
typedef long long ll;
int main()
{
    multiset<unsigned ll>s;
    ll ans=0,n;
    ll inf=479001600;
    while(cin>>n)
    {
        if(inf%n==0)
        {
            multiset<unsigned ll>::iterator it=s.find(inf/n);
            if(it!=s.end())
            {
                ans++;
                s.erase(it);
            }
            else s.insert(n);
        }
    }
    cout<<ans<<endl;
    return 0;
}