#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define main dummy_main
int main( ) {
return 0 ;
}
#undef main
long long c[ 60 ] [ 60 ] ;
class Solution{
public :
int countVowelStrings( int n) {
int i;
for ( i= ( 0 ) ; i< ( 60 ) ; i++ ) {
c[ 0 ] [ i] = 0 ;
}
for ( i= ( 0 ) ; i< ( 60 ) ; i++ ) {
c[ i] [ 0 ] = 1 ;
}
for ( i= ( 1 ) ; i< ( 60 ) ; i++ ) {
int j;
for ( j= ( 1 ) ; j< ( 60 ) ; j++ ) {
c[ i] [ j] = c[ i- 1 ] [ j- 1 ] + c[ i- 1 ] [ j] ;
}
}
return c[ n+ 4 ] [ 4 ] ;
}
}
;
// cLay varsion 20201101-1
// --- original code ---
// #define main dummy_main
// {}
// #undef main
//
// ll c[60][60];
//
// class Solution {
// public:
// int countVowelStrings(int n) {
// rep(i,60) c[0][i] = 0;
// rep(i,60) c[i][0] = 1;
// rep(i,1,60) rep(j,1,60) c[i][j] = c[i-1][j-1] + c[i-1][j];
// return c[n+4][4];
// }
// };
I3ByYWdtYSBHQ0Mgb3B0aW1pemUgKCJPZmFzdCIpCiNpbmNsdWRlPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiNkZWZpbmUgbWFpbiBkdW1teV9tYWluCmludCBtYWluKCl7CiAgcmV0dXJuIDA7Cn0KI3VuZGVmIG1haW4KbG9uZyBsb25nIGNbNjBdWzYwXTsKY2xhc3MgU29sdXRpb257CiAgcHVibGljOgogIGludCBjb3VudFZvd2VsU3RyaW5ncyhpbnQgbil7CiAgICBpbnQgaTsKICAgIGZvcihpPSgwKTtpPCg2MCk7aSsrKXsKICAgICAgY1swXVtpXSA9IDA7CiAgICB9CiAgICBmb3IoaT0oMCk7aTwoNjApO2krKyl7CiAgICAgIGNbaV1bMF0gPSAxOwogICAgfQogICAgZm9yKGk9KDEpO2k8KDYwKTtpKyspewogICAgICBpbnQgajsKICAgICAgZm9yKGo9KDEpO2o8KDYwKTtqKyspewogICAgICAgIGNbaV1bal0gPSBjW2ktMV1bai0xXSArIGNbaS0xXVtqXTsKICAgICAgfQogICAgfQogICAgcmV0dXJuIGNbbis0XVs0XTsKICB9Cn0KOwovLyBjTGF5IHZhcnNpb24gMjAyMDExMDEtMQoKLy8gLS0tIG9yaWdpbmFsIGNvZGUgLS0tCi8vICNkZWZpbmUgbWFpbiBkdW1teV9tYWluCi8vIHt9Ci8vICN1bmRlZiBtYWluCi8vIAovLyBsbCBjWzYwXVs2MF07Ci8vIAovLyBjbGFzcyBTb2x1dGlvbiB7Ci8vIHB1YmxpYzoKLy8gICBpbnQgY291bnRWb3dlbFN0cmluZ3MoaW50IG4pIHsKLy8gICAgIHJlcChpLDYwKSBjWzBdW2ldID0gMDsKLy8gICAgIHJlcChpLDYwKSBjW2ldWzBdID0gMTsKLy8gICAgIHJlcChpLDEsNjApIHJlcChqLDEsNjApIGNbaV1bal0gPSBjW2ktMV1bai0xXSArIGNbaS0xXVtqXTsKLy8gICAgIHJldHVybiBjW24rNF1bNF07Ci8vICAgfQovLyB9Owo=