#include<bits/stdc++.h>
using namespace std;
#define rep2(i,j,k) for(ll i = ll(j); i < ll(k); i++)
#define rep(i,k) rep2(i,0,k)
#define rrep2(i,j,k) for(ll i = ll(j)-1; i >= ll(k); i--)
#define rrep(i,k) rrep2(i,k,0)
#define all(a) a.begin(), a.end()
#define SZ(a) ll(a.size())
#define eb emplace_back
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vp = vector<P>;
using vvp = vector<vp>;
const ll inf = LLONG_MAX/4;
bool chmin(auto& a, auto& b) {return a > b ? a = b, 1 : 0; }
bool chmax(auto& a, auto& b) {return a < b ? a = b, 1 : 0; }

vl f(vl v) {
	int n = SZ(v);
	vl res;
	auto g = [&](auto &g, int i, ll val) -> void {
		if(i == n) {
			res.eb(val);
			return;
		}
		ll now = 1;
		rep2(j,i,n) {
			now *= v[j];
			g(g,j+1,val+now);
			g(g,j+1,val-now);
		}
	};
	g(g, 0, 0);
	return res;
}

int main(){
	cin.tie(0)->sync_with_stdio(0);
	vl v(4);
	rep(i, 4) cin >> v[i];
	set<ll> st;
	vl ord(4);
	iota(all(ord), 0);
	do {
	rep(b, 7) {
		vl a;
		a.eb(v[ord[0]]);
		rep(i, 3) {
			if(b>>i&1) {
				a.back() = a.back() * 10 + v[ord[i+1]];
			} else {
				a.eb(v[ord[i+1]]);
			}
		}
		for(ll j : f(a)) if(j >= 0) st.insert(j);
	}
	} while(next_permutation(all(ord)));
	cout << st.size() << endl;

}