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

set<int> ans;

void pm(vector<int> a) {
    int n = (int)a.size() - 1;
    for (int s = 0; s < (1 << n); ++s) {
        int x = a[0];
        for (int i = 0; i < n; ++i) {
            if (s >> i & 1) {
                x += a[i + 1];
            } else {
                x -= a[i + 1];
            }
        }
        if (x >= 0) {
            ans.insert(x);
        }
    }
}

void mul(vector<int> a) {
    int n = (int)a.size() - 1;
    for (int s = 0; s < (1 << n); ++s) {
        vector<int> b;
        int x = 1;
        for (int i = 0; i <= n; ++i) {
            x *= a[i];
            if (i == n || (s >> i & 1)) {
                b.push_back(x);
                x = 1;
            }
        }
        pm(b);
    }
}

int main() {
    vector<int> a(4);
    for (auto& x : a) cin >> x;
    sort(a.begin(), a.end());
    do {
        for (int s = 1; s < 8; ++s) {
            vector<int> b;
            int x = 0;
            for (int i = 0; i < 4; i++) {
                x = 10 * x + a[i];
                if (i == 3 || (s >> i & 1)) {
                    b.push_back(x);
                    x = 0;
                }
            }
            mul(b);
        }
    } while (next_permutation(a.begin(), a.end()));
    cout << ans.size() << endl;
}