wrong answer for 4 test cases
#include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
long long int catalan( int n){
long long int catalan[n+1];
catalan[0] = catalan[1] = 1;
for(int i=2;i<=n;i++){
catalan[i] = 0;
for(int j=0;j<i;j++){
catalan[i]+=((catalan[j]%mod)*(catalan[i-j-1]%mod))%mod;
}
}
return catalan[n];
}
int main(){
int n;
cin>>n;
int ans = catalan(n);
cout<<ans<<endl;
return 0;
}