/*
TASK:necklace
LANG:C++
*/
#include<iostream>
using namespace std;

int main()
{
    int a[61];
    int k, p, q, N, ans=0, i, j, prime=0, iprime=0, br1, br2;
    cin >> N;
    if(N==1)
    {
         cout << 1 << "\n";
         return 0;
    }
    if(N==2)
    {
         cout << 2 << "\n";
         return 0;
    }
    for(i=1;i<=N;i++)
    {
        if(i%2) iprime++;
        else prime++;
    }
    //cout << prime << " " << iprime << endl;
    for(i=1;i<=N/2;i++)
        for(j=0;j<=N/2;j++)
        {
           int d=i-j;
           if(d<0) d=j-i;
           if(d%3==0)
           {
                //cout << i << " " << j << endl;
                if(i==1 && j==1)
                {
                    ans+=N/2;
                }
                else
                {
                    p=0; q=0;
                    for(br1=1;br1<prime;br1++)
                    {
                        if(br1==1) q=0;
                        else if(br1==2) q++;
                        else q+=i;
                    }
                    for(br2=1;br2<iprime;br2++)
                    {
                        if(br2==1) p=0;
                        else if(br2==2) p++;
                        else p+=j;
                    }
                    if(i==j)
                    {
                        ans+=p*j;
                    }
                    else ans+=i*q + j*p;
                }
            }
        }
                                    
    cout << ans << "\n";
    //system("Pause");
    return 0;
}
                
                                                                                                                
