#include <bits/stdc++.h>
using namespace std;

#define rep(i,a,b) for(int i=a;i<b;++i)
#define all(x) begin(x),end(x)
#define sz(x) (int)(x).size();
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
set<int>s;
void solve(vector<int>v,bool mode){
    int n = sz(v);
    if(n==1){
        s.insert(v[0]);
        return;
    }
    if(mode==1){
        vector<int>u;
        for(int i=0;i+1<n;i++){
            vector<int>u;
            for(int j=0;j<i;j++)u.push_back(v[j]);
            u.push_back(v[i]*v[i+1]);
            for(int j=i+2;j<n;j++)u.push_back(v[j]);
            solve(u,1);
            solve(u,0);
        }
    }else{
        for(int i=0;i<(1<<n);i++){
            if(i&1)continue;
            int sum = 0;
            for(int j=0;j<n;j++){
                if(i&(1<<j))sum -=v[j];
                else sum += v[j];
            }
            s.insert(sum);
        }
        return;
    }
}
int main()
{
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);
    int a[4];
    for(int i=0;i<4;i++)cin>>a[i];
    vector<int>p = {0,1,2,3};
    while(true){
        vector<int>b(4);
        for(int i=0;i<4;i++)b[i] = a[p[i]];

        solve(b,1);
        solve(b,0);
        vector<int>c = {10*b[0]+b[1],b[2],b[3]};
        solve(c,1);
        solve(c,0);
        c = {b[0],b[1],10*b[2]+b[3]};
        solve(c,1);
        solve(c,0);
        c = {10*b[0]+b[1],10*b[2]+b[3]};
        solve(c,1);
        solve(c,0);


        c = {100*b[0]+10*b[1]+b[2],b[3]};
        solve(c,1);
        solve(c,0);
        c = {b[0],100*b[1]+10*b[2]+b[3]};
        solve(c,1);
        solve(c,0);
        if(!next_permutation(all(p)))break;
    }
    int ans = 0;
    for(int x:s)ans+=x>=0;
    cout<<ans<<'\n';
}