#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;

#define MOD 1000000007

int main(){
  int N, R, G, B;
  cin >> N >> R >> G >> B;

  if(R+G+B > N){
    cout << 0 << endl;
    return 0;
  }

  vector<vector<vector<vector<vector<vector<int>>>>>> dp(N+1,vector<vector<vector<vector<vector<int>>>>>(R+1,vector<vector<vector<vector<int>>>>(G+1,vector<vector<vector<int>>>(B+1,vector<vector<int>>(4,vector<int>(2,0))))));
  
  dp[0][R][G][B][0][0] = 1;
  rep(i,N) rep(r,R+1) rep(g,G+1) rep(b,B+1) rep(j,4) rep(k,2) if(dp[i][r][g][b][j][k]>0){
    int v = dp[i][r][g][b][j][k];

    if(k==0){
      if(j==0){
        if(r>0){
          dp[i+1][r-1][g][b][1][0] += v;
          dp[i+1][r-1][g][b][1][0] %= MOD;
        }
        if(g>0){
          dp[i+1][r][g-1][b][2][0] += v;
          dp[i+1][r][g-1][b][2][0] %= MOD;
        }
        if(b>0){
          dp[i+1][r][g][b-1][3][0] += v;
          dp[i+1][r][g][b-1][3][0] %= MOD;
        }
      }
      if(j==1){
        if(g>0){
          dp[i+1][r][g-1][b][2][1] += v;
          dp[i+1][r][g-1][b][2][1] %= MOD;
        }
        if(b>0){
          dp[i+1][r][g][b-1][3][1] += v;
          dp[i+1][r][g][b-1][3][1] %= MOD;
        }
      }
      if(j==2){
        if(r>0){
          dp[i+1][r-1][g][b][1][1] += v;
          dp[i+1][r-1][g][b][1][1] %= MOD;
        }
        if(b>0){
          dp[i+1][r][g][b-1][3][1] += v;
          dp[i+1][r][g][b-1][3][1] %= MOD;
        }
      }
      if(j==3){
        if(r>0){
          dp[i+1][r-1][g][b][1][1] += v;
          dp[i+1][r-1][g][b][1][1] %= MOD;
        }
        if(g>0){
          dp[i+1][r][g-1][b][2][1] += v;
          dp[i+1][r][g-1][b][2][1] %= MOD;
        }
      }
      dp[i+1][r][g][b][0][0] += v;
      dp[i+1][r][g][b][0][0] %= MOD;
      
    }else{
      dp[i+1][r][g][b][0][0] += v;
      dp[i+1][r][g][b][0][0] %= MOD;
    }
  }

  ll ret = 0;
  rep(j,4) rep(k,2){
    ret += dp[N][0][0][0][j][k];
    ret %= MOD;
  }

  cout << ret << endl;
  
  return 0;
}