// {{{ by shik
#include <bits/stdc++.h>
#include <unistd.h>
#define SZ(x) ((int)(x).size())
#define ALL(x) begin(x),end(x)
#define REP(i,n) for ( int i=0; i<int(n); i++ )
#define REP1(i,a,b) for ( int i=(a); i<=int(b); i++ )
#define FOR(it,c) for ( auto it=(c).begin(); it!=(c).end(); it++ )
#define MP make_pair
#define PB push_back
using namespace std;
typedef long long LL;
typedef pair<int,int> PII;
typedef vector<int> VI;

#ifdef SHIK
template<typename T>
void _dump( const char* s, T&& head ) { cerr<<s<<"="<<head<<endl; }

template<typename T, typename... Args>
void _dump( const char* s, T&& head, Args&&... tail ) {
    int c=0;
    while ( *s!=',' || c!=0 ) {
        if ( *s=='(' || *s=='[' || *s=='{' ) c++;
        if ( *s==')' || *s==']' || *s=='}' ) c--;
        cerr<<*s++;
    }
    cerr<<"="<<head<<", ";
    _dump(s+1,tail...);
}

#define dump(...) do { \
    fprintf(stderr, "%s:%d - ", __PRETTY_FUNCTION__, __LINE__); \
    _dump(#__VA_ARGS__, __VA_ARGS__); \
} while (0)

template<typename Iter>
ostream& _out( ostream &s, Iter b, Iter e ) {
    s<<"[";
    for ( auto it=b; it!=e; it++ ) s<<(it==b?"":" ")<<*it;
    s<<"]";
    return s;
}

template<typename A, typename B>
ostream& operator <<( ostream &s, const pair<A,B> &p ) { return s<<"("<<p.first<<","<<p.second<<")"; }
template<typename T>
ostream& operator <<( ostream &s, const vector<T> &c ) { return _out(s,ALL(c)); }
template<typename T, size_t N>
ostream& operator <<( ostream &s, const array<T,N> &c ) { return _out(s,ALL(c)); }
template<typename T>
ostream& operator <<( ostream &s, const set<T> &c ) { return _out(s,ALL(c)); }
template<typename A, typename B>
ostream& operator <<( ostream &s, const map<A,B> &c ) { return _out(s,ALL(c)); }
#else
#define dump(...)
#endif

template<typename T>
void _R( T &x ) { cin>>x; }
void _R( int &x ) { scanf("%d",&x); }
void _R( long long &x ) { scanf("%" PRId64,&x); }
void _R( double &x ) { scanf("%lf",&x); }
void _R( char &x ) { scanf(" %c",&x); }
void _R( char *x ) { scanf("%s",x); }

void R() {}
template<typename T, typename... U>
void R( T& head, U&... tail ) {
    _R(head);
    R(tail...);
}

template<typename T>
void _W( const T &x ) { cout<<x; }
void _W( const int &x ) { printf("%d",x); }
template<typename T>
void _W( const vector<T> &x ) {
    for ( auto i=x.cbegin(); i!=x.cend(); i++ ) {
        if ( i!=x.cbegin() ) putchar(' ');
        _W(*i);
    }
}

void W() {}
template<typename T, typename... U>
void W( const T& head, const U&... tail ) {
    _W(head);
    putchar(sizeof...(tail)?' ':'\n');
    W(tail...);
}

#ifdef SHIK
#define FILEIO(...)
#else
#define FILEIO(name) do {\
    freopen(name ".in","r",stdin); \
    freopen(name ".out","w",stdout); \
} while (0)
#endif

// }}}

const int M=2e5+10;
const LL MOD=1e9+7;


int n,x,y,z,tot,m;
VI vv[M];

int path[20];
void dfs( int lv, int s ) {
    vv[m++]=VI(path,path+lv);
    int u=min(tot-s,10);
    REP1(i,1,u) {
        path[lv]=i;
        dfs(lv+1,s+i);
    }
}

bool good[M];
VI to[M];
LL dp[2][M];

int main() {
    R(n,x,y,z);
    tot=x+y+z;
    dfs(0,0);
    sort(vv,vv+m);
    dump(m);
    REP(i,m) {
        int s=0,t=0;
        for ( int j:vv[i] ) {
            s+=j;
            if ( (t==0 && s==x) || (t==1 && s==y) || (t==2 && s==z) ) t++,s=0;
        }
        if ( t==3 ) good[i]=1;
    }
    REP(i,m) {
        REP1(j,1,10) {
            if ( good[i] ) to[i].PB(i);
            else if ( j>tot ) to[i].PB(0);
            else {
                VI v;
                v.PB(j);
                int s=j;
                for ( int k=SZ(vv[i])-1; k>=0; k-- ) {
                    s+=vv[i][k];
                    if ( s>tot ) break;
                    v.PB(vv[i][k]);
                }
                reverse(ALL(v));
                int idx=lower_bound(vv,vv+m,v)-vv;
                assert(vv[idx]==v);
                to[i].PB(idx);
            }
        }
    }
    int u=0;
    dp[u][0]=1;
    REP(i,n) {
        memset(dp[u^1],0,m*sizeof(LL));
        REP(j,m) {
            int me=dp[u][j]%MOD;
            for ( int k:to[j] ) dp[u^1][k]+=me;
        }
        u^=1;
    }
    LL ans=0;
    REP(i,m) if ( good[i] ) ans+=dp[u][i];
    ans%=MOD;
    W(ans);
    return 0;
}


Measured memory_bytes: 28160