玄关求调(RE)

#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
typedef long long ll;
const int N=1e6+10,MOD=1e9+7;
int n;
ll dp[4][N];
int main()
{
scanf("%d",&n);
dp[0][0]=1;
for(int i=1;i<=4;i++)
for(int j=1;j<=n;j++)
dp[i][j]=(dp[i-1][j-1]+dp[i][j-1])%MOD;
printf("%lld\n",dp[4][n]);
return 0;
}