public class Main {
  private static void solve() {
    int n = ni();
    int R = ni();
    int G = ni();
    int B = ni();

    long mod = 1000000007;

    int sum = R + G + B;
    if (n < sum + (sum - 1) / 2) {
      System.out.println(0);
      return;
    }
    
    //RGBE
    //0 *E
    //1 ER
    //2 EG
    //3 EB
    //4 RG
    //5 RB
    //6 GR
    //7 GB
    //8 BR
    //9 BG
    long[][][][][] dp = new long[2][R + 1][G + 1][B + 1][10];
    dp[0][0][0][0][0] = 1;

    for (int i = 0; i < n; i ++) {
      int from = i % 2;
      int to = (i + 1) % 2;
      for (int r = 0; r <= R; r ++) {
        for (int g = 0; g <= G; g ++) {
          for (int b = 0; b <= B; b ++) {
            if (r < R) {
              dp[to][r + 1][g][b][1] += dp[from][r][g][b][0];
              dp[to][r + 1][g][b][6] += dp[from][r][g][b][2];
              dp[to][r + 1][g][b][8] += dp[from][r][g][b][3];
            }
            if (g < G) {
              dp[to][r][g + 1][b][2] += dp[from][r][g][b][0];
              dp[to][r][g + 1][b][4] += dp[from][r][g][b][1];
              dp[to][r][g + 1][b][9] += dp[from][r][g][b][3];
            }
            if (b < B) {
              dp[to][r][g][b + 1][3] += dp[from][r][g][b][0];
              dp[to][r][g][b + 1][5] += dp[from][r][g][b][1];
              dp[to][r][g][b + 1][7] += dp[from][r][g][b][2];
            }
            for (int s = 0; s < 10; s ++) {
              dp[to][r][g][b][0] += dp[from][r][g][b][s];
            }
          }
        }
      }

      for (int r = 0; r <= R; r ++) {
        for (int g = 0; g <= G; g ++) {
          for (int b = 0; b <= B; b ++) {
            for (int s = 0; s < 10; s ++) {
              dp[to][r][g][b][s] %= mod;
              dp[from][r][g][b][s] = 0;
            }
          }
        }
      }
    }
    
    long ret = 0;
    for (long v : dp[n % 2][R][G][B]) {
      ret += v;
      ret %= mod;
    }
    System.out.println(ret);
  }

  public static void main(String[] args) {
    new Thread(null, new Runnable() {
      @Override
      public void run() {
        long start = System.currentTimeMillis();
        String debug = args.length > 0 ? args[0] : null;
        if (debug != null) {
          try {
            is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
          } catch (Exception e) {
            throw new RuntimeException(e);
          }
        }
        reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
        solve();
        out.flush();
        tr((System.currentTimeMillis() - start) + "ms");
      }
    }, "", 64000000).start();
  }

  private static java.io.InputStream is = System.in;
  private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
  private static java.util.StringTokenizer tokenizer = null;
  private static java.io.BufferedReader reader;

  public static String next() {
    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
      try {
        tokenizer = new java.util.StringTokenizer(reader.readLine());
      } catch (Exception e) {
        throw new RuntimeException(e);
      }
    }
    return tokenizer.nextToken();
  }

  private static double nd() {
    return Double.parseDouble(next());
  }

  private static long nl() {
    return Long.parseLong(next());
  }

  private static int[] na(int n) {
    int[] a = new int[n];
    for (int i = 0; i < n; i++)
      a[i] = ni();
    return a;
  }

  private static char[] ns() {
    return next().toCharArray();
  }

  private static long[] nal(int n) {
    long[] a = new long[n];
    for (int i = 0; i < n; i++)
      a[i] = nl();
    return a;
  }

  private static int[][] ntable(int n, int m) {
    int[][] table = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[i][j] = ni();
      }
    }
    return table;
  }

  private static int[][] nlist(int n, int m) {
    int[][] table = new int[m][n];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[j][i] = ni();
      }
    }
    return table;
  }

  private static int ni() {
    return Integer.parseInt(next());
  }

  private static void tr(Object... o) {
    if (is != System.in)
      System.out.println(java.util.Arrays.deepToString(o));
  }
}