#include <bits/stdc++.h>

const int MaxN = 42; 
const int MaxS = 1 << 17 | 1; 
const int mod = 1e9 + 7; 

int n, x, y, z, f[MaxN][MaxS], g[MaxS][11]; 

inline void add(int &x, const int &y)
{
	x += y; 
	x >= mod ? x -= mod : 0; 
}

int main()
{
	std::cin >> n >> x >> y >> z; 
	
	y += x, z += y; 
	int maxs = 1 << z; 
	
	for (int s = 1; s <= maxs; ++s)
		for (int i = 1; i <= 10; ++i)
		{
			g[s][i] = 1; 
			if (s == maxs)
				g[s][i] = maxs; 
			else
			{
				for (int k = 0; k < z; ++k)	
					if ((s >> k & 1) && k + i <= z && !(k < x && k + i > x) && !(k < y && k + i > y))
						g[s][i] |= 1 << k + i; 
				if (g[s][i] >= maxs)
					g[s][i] = maxs; 
			}
		}
	
	f[0][1] = 1; 
	for (int i = 0; i < n; ++i)
		for (int s = 1; s <= maxs; ++s)
			if (f[i][s])
			{
				for (int j = 1; j <= 10; ++j)
					add(f[i + 1][g[s][j]], f[i][s]); 
			}
	
	std::cout << f[n][maxs] << std::endl; 
	
	return 0; 
}