import java.util.*;

public class Euler259 {
    public static String solve() {
        int OPS = 5;
        int totalExpr = 1;
        for (int i = 0; i < 8; i++)
            totalExpr *= OPS;
        Set<Long> allPos = new HashSet<>();

        for (int code = 0; code < totalExpr; code++) {
            int x = code;
            List<Integer> values = new ArrayList<>();
            List<Integer> ops = new ArrayList<>();
            int current = 1;
            for (int i = 0; i < 8; i++) {
                int choice = x % OPS;
                x /= OPS;
                int next = i + 2;
                if (choice == 4) {
                    current = current * 10 + next;
                } else {
                    values.add(current);
                    ops.add(choice);
                    current = next;
                }
            }
            values.add(current);
            Set<Long> results = allResults(values, ops);
            for (long v : results)
                if (v > 0)
                    allPos.add(v);
        }
        long sum = 0;
        for (long v : allPos)
            sum += v;
        return String.valueOf(sum);
    }

    // Fraction: numerator in high 32, denominator in low 32 (signed)
    static final long INVALID = Long.MIN_VALUE;

    static long makeFrac(long n, long d) {
        if (d == 0)
            return INVALID;
        if (d < 0) {
            n = -n;
            d = -d;
        }
        long g = gcd(Math.abs(n), d);
        return ((n / g) << 32) | (d / g);
    }

    static long gcd(long a, long b) {
        while (b != 0) {
            long t = b;
            b = a % b;
            a = t;
        }
        return a;
    }

    static long num(long f) {
        return f >> 32;
    }

    static long den(long f) {
        return f & 0xFFFFFFFFL;
    }

    static long applyOp(long a, long b, int op) {
        long an = num(a), ad = den(a), bn = num(b), bd = den(b);
        switch (op) {
            case 0:
                return makeFrac(an * bd + bn * ad, ad * bd);
            case 1:
                return makeFrac(an * bd - bn * ad, ad * bd);
            case 2:
                return makeFrac(an * bn, ad * bd);
            case 3:
                return bn == 0 ? INVALID : makeFrac(an * bd, ad * bn);
            default:
                return INVALID;
        }
    }

    static Set<Long> allResults(List<Integer> values, List<Integer> ops) {
        int n = values.size();
        Set<Long>[][] dp = new HashSet[n][n];
        for (int i = 0; i < n; i++) {
            dp[i][i] = new HashSet<>();
            dp[i][i].add(makeFrac(values.get(i), 1));
        }
        for (int len = 2; len <= n; len++) {
            for (int l = 0; l <= n - len; l++) {
                int r = l + len - 1;
                dp[l][r] = new HashSet<>();
                for (int k = l; k < r; k++) {
                    int op = ops.get(k);
                    for (long a : dp[l][k]) {
                        for (long b : dp[k + 1][r]) {
                            long v = applyOp(a, b, op);
                            if (v != INVALID)
                                dp[l][r].add(v);
                        }
                    }
                }
            }
        }
        Set<Long> result = new HashSet<>();
        for (long f : dp[0][n - 1])
            if (den(f) == 1) {
                long v = num(f);
                if (v > 0)
                    result.add(v);
            }
        return result;
    }

    public static void main(String[] args) {
        System.out.println(solve());
    }
}