p1273 Daily clock

　　The problem is not difficult, but it is mainly to instill in you the idea of ​​making a table. . .

int ans[ 510 ]={ 1 },n;
int a[ 96 ]= {
 0 , 2 , 3 , 5 , 7 , 11 , 13 , 17 , 19 , 23 , 29 , 31 , 37 , 41 , 43 , 47 , 53 , 59 , 61 , 67 , 71 , 73 , 79 , 83,89,97,101,
103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,
223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,
337,347,349,353,359,367,373,379,383,389,397,401,409, 419,421,431,433,439,443,449,457,461,463,467,479,487,491,499 } ;
 _ _ _ _ _ _ _ _ _ _ _ _ _
 _ _ _ _ _ _ _ _ _ _ _ _ _ _ intmain ()
{    
/*freopen("123.in","r",stdin);
freopen("123.out","w",stdout);*/
ios::sync_with_stdio(false);

    cin>>n;
    for(int i=1;i<=95;i++)
        for(int j=a[i];j<=n;j++)
            ans[j] +=ans[j -a[i]];
    cout << years[n];
    return  0 ;
}