#include <iostream>
using namespace std;
#define mod 1000000007
long long combination(long long i);
int main() {
int n,count;
long long i=1,ans=1;
cin>>n;
if(n<13)
cout<<"0";
else
{
count=n-13;
for(count;count>=2;count=count-2)
{
ans=(ans+combination(i))%mod;
i++;
}
cout<<ans;
}
return 0;
}
long long combination(long long i)
{
long long num=1;
i=i+5;
int j;
for(j=0;j<5;j++)
{
num=(num*i)%mod;
i--;
}
// cout<<num<<endl;
return (num/120)%mod;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwojZGVmaW5lIG1vZCAxMDAwMDAwMDA3CmxvbmcgbG9uZyBjb21iaW5hdGlvbihsb25nIGxvbmcgaSk7CmludCBtYWluKCkgewoJaW50IG4sY291bnQ7Cglsb25nIGxvbmcgaT0xLGFucz0xOwoJY2luPj5uOwoJaWYobjwxMykKCWNvdXQ8PCIwIjsKCWVsc2UKCXsKCWNvdW50PW4tMTM7Cglmb3IoY291bnQ7Y291bnQ+PTI7Y291bnQ9Y291bnQtMikKCXsKCQlhbnM9KGFucytjb21iaW5hdGlvbihpKSklbW9kOwoJCWkrKzsKCX0KCWNvdXQ8PGFuczsKCX0KCXJldHVybiAwOwp9CiAKIApsb25nIGxvbmcgY29tYmluYXRpb24obG9uZyBsb25nIGkpCnsKIAoJbG9uZyBsb25nIG51bT0xOwoJaT1pKzU7CglpbnQgajsKIAoJZm9yKGo9MDtqPDU7aisrKQoJewoJbnVtPShudW0qaSklbW9kOwoJaS0tOwoJfQovLwljb3V0PDxudW08PGVuZGw7CglyZXR1cm4gKG51bS8xMjApJW1vZDsJCn0=