#include <iostream>
#include <vector>
#include <set>
#include <unordered_set>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;



int main() {
    int N = 4;
    std::vector<int> A(N);
    for(int i = 0; i < N; i++) {
        std::cin >> A[i];
    }
    std::vector<int> p = { 0, 0, 1, 2 };
    std::unordered_set<int> st;
    std::sort(A.begin(), A.end());
    do {
    rep(a, 4) rep(b, 4) rep(c, 4) {
        if(a == b && b == c && c == 3) continue;
        std::vector<int> op = { a, b, c };
        std::vector<int> x = A;
        while(x.size() > 1) {
            int i = 0;
            for(int j = 1; j < op.size(); j++) {
                if(p[op[i]] < p[op[j]]) {
                    i = j;
                }
            }
            int ans = 0;
            if(op[i] == 0) {
                ans = x[i] + x[i + 1];
            }
            else if(op[i] == 1) {
                ans = x[i] - x[i + 1];
            }
            else if(op[i] == 2) {
                ans = x[i] * x[i + 1];
            }
            else {
                ans = x[i] * 10 + x[i + 1];
            }
            x[i] = ans;
            x.erase(x.begin() + i + 1);
            op.erase(op.begin() + i);
        }
        if(x.front() >= 0) {
            st.insert(x.front());
        }
    }
    } while(std::next_permutation(A.begin(), A.end()));
    using i64 = long long;
    std::cout << st.size() << std::endl;
}