#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>

#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
typedef long long int ll;

// clang-format off
#ifdef _DEBUG_
#define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; PPPPP(__VA_ARGS__); cerr << endl; } while(false)
template<typename T> void PPPPP(T t) { cerr << t; }
template<typename T, typename... S> void PPPPP(T t, S... s) { cerr << t << ", "; PPPPP(s...); }
#else
#define dump(...)
#endif
template<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }
template<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }
template<typename T>
bool chmin(T &a, T b) { if (a > b) {a = b; return true; } return false;}
template<typename T>
bool chmax(T &a, T b) { if (a < b) {a = b; return true; } return false;}
// clang-format on

template<ll MOD = 1000000007>
class ModInt {
    ll n;
    static constexpr ModInt pow(const ModInt x, ll p) {
        ModInt<MOD> ans = 1;
        for (ModInt<MOD> m = x; p > 0; p /= 2, m *= m) {
            if (p % 2) ans *= m;
        }
        return ans;
    }
    ModInt constexpr inverse() const {
        return ModInt::pow(*this, MOD - 2);
    }

public:
    ModInt()
        : n(0) {}
    ModInt(ll _n)
        : n(((_n % MOD) + MOD) % MOD) {}
    ModInt operator+=(const ModInt &m) {
        n += m.n;
        if (n >= MOD) n -= MOD;
        return *this;
    }
    ModInt operator-=(const ModInt &m) {
        n -= m.n;
        if (n < 0) n += MOD;
        return *this;
    }
    ModInt operator*=(const ModInt &m) {
        n *= m.n;
        if (n >= MOD) n %= MOD;
        return *this;
    }
    ModInt operator/=(const ModInt &m) {
        (*this) *= m.inverse();
        return *this;
    }
    friend ModInt operator+(ModInt t, const ModInt &m) {
        return t += m;
    }
    friend ModInt operator-(ModInt t, const ModInt &m) {
        return t -= m;
    }
    friend ModInt operator*(ModInt t, const ModInt &m) {
        return t *= m;
    }
    friend ModInt operator/(ModInt t, const ModInt &m) {
        return t /= m;
    }
    ModInt operator=(const ll l) {
        n = l % MOD;
        if (n < 0) n += MOD;
        return *this;
    }
    friend ostream &operator<<(ostream &out, const ModInt &m) {
        out << m.n;
        return out;
    }
    friend istream &operator>>(istream &in, ModInt &m) {
        ll l;
        in >> l;
        m = l;
        return in;
    }
};
using mint = ModInt<>;
mint operator"" _m(unsigned long long m) {
    return mint(m);
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n, x, y, z;
    cin >> n >> x >> y >> z;

    int sum = x + y + z;
    int mask = (1 << sum) - 1;
    vector<bool> check(1 << sum, false);
    auto check_func = [&](int i) {
        vector<int> parse;
        int cnt = 1;
        int lst = -1;
        REP(a, 0, sum) {
            if (i % 2) {
                parse.push_back(cnt);
                cnt = 0;
            }
            cnt++;
            lst = i % 2;
            i /= 2;
        }
        if (!lst) {
            return false;
        }

        int s = 0;
        while (parse.size() && s < z) {
            s += parse.back();
            parse.pop_back();
        }
        if (s != z) return false;
        s = 0;
        while (parse.size() && s < y) {
            s += parse.back();
            parse.pop_back();
        }
        if (s != y) return false;
        s = 0;
        while (parse.size() && s < x) {
            s += parse.back();
            parse.pop_back();
        }
        if (s != x) return false;
        return true;
    };
    REP(i, 0, 1 << sum) {
        check[i] = !check_func(i);
    }

    auto dp = make_v(n + 1, 1 << sum, 0_m);
    dp[0][0] = 1;
    REP(i, 0, n) {
        REP(j, 0, 1 << sum) {
            int nxt = j;
            (nxt <<= 1) &= mask;
            nxt |= 1;
            REP(k, 1, 11) {
                if (k != 1) {
                    (nxt <<= 1) &= mask;
                }
                if (check[nxt]) {
                    dp[i + 1][nxt] += dp[i][j];
                }
            }
        }
    }
    mint ans = 1;
    REP(i, 0, n) {
        ans *= 10;
    }
    REP(i, 0, 1 << sum) {
        ans -= dp[n][i];
    }
    cout << ans << endl;

    return 0;
}


Measured memory_bytes: 43392