/*Rabbi Zidni Ilma*/

#include<bits/stdc++.h>
using namespace std;
#define   ll             long long
#define   scl(n)         scanf("%lld",&n)
#define   scll(n,m)      scanf("%lld %lld",&n,&m)
#define   YES            printf("YES\n")
#define   Yes            printf("Yes\n")
#define   yes            printf("yes\n")
#define   NO             printf("NO\n")
#define   No             printf("No\n")
#define   no             printf("no\n")
#define   nl             printf("\n")
#define   pb             push_back
#define   mp             make_pair
#define   frs            first
#define   scn            second
#define   mod            1000000007
#define   pi             acos(-1)
#define   CheckBit(x,k)  (x&(1ll<<k))
#define   read           freopen("input.txt","r",stdin)
#define   write          freopen("kanta.txt","w",stdout)
#define   N              100000

int main()
{
    ll tc,n,m,i,j,x,ans;
    scl(n);

    m=n;
    if(n%2!=0)
        m--;
    x=m/2;

    if(n%2==0)
        ans=(x+1)*(x+1);
    else
        ans=2*(x+1)*(x+2);

    printf("%lld\n",ans);
    return 0;
}

### Prompt

Generate a Cpp solution to the following problem:

A robot is standing at the origin of the infinite two-dimensional plane. Each second the robot moves exactly 1 meter in one of the four cardinal directions: north, south, west, and east. For the first step the robot can choose any of the four directions, but then at the end of every second it has to turn 90 degrees left or right with respect to the direction it just moved in. For example, if the robot has just moved north or south, the next step it takes has to be either west or east, and vice versa.

The robot makes exactly n steps from its starting position according to the rules above. How many different points can the robot arrive to at the end? The final orientation of the robot can be ignored.

Input

The only line contains a single integer n (1 ≤ n ≤ 1000) — the number of steps the robot makes.

Output

Print a single integer — the number of different possible locations after exactly n steps.

Examples

Input


1


Output


4


Input


2


Output


4


Input


3


Output


12

Note

In the first sample case, the robot will end up 1 meter north, south, west, or east depending on its initial direction.

In the second sample case, the robot will always end up √{2} meters north-west, north-east, south-west, or south-east.

### Response

```cpp
/*Rabbi Zidni Ilma*/

#include<bits/stdc++.h>
using namespace std;
#define   ll             long long
#define   scl(n)         scanf("%lld",&n)
#define   scll(n,m)      scanf("%lld %lld",&n,&m)
#define   YES            printf("YES\n")
#define   Yes            printf("Yes\n")
#define   yes            printf("yes\n")
#define   NO             printf("NO\n")
#define   No             printf("No\n")
#define   no             printf("no\n")
#define   nl             printf("\n")
#define   pb             push_back
#define   mp             make_pair
#define   frs            first
#define   scn            second
#define   mod            1000000007
#define   pi             acos(-1)
#define   CheckBit(x,k)  (x&(1ll<<k))
#define   read           freopen("input.txt","r",stdin)
#define   write          freopen("kanta.txt","w",stdout)
#define   N              100000

int main()
{
    ll tc,n,m,i,j,x,ans;
    scl(n);

    m=n;
    if(n%2!=0)
        m--;
    x=m/2;

    if(n%2==0)
        ans=(x+1)*(x+1);
    else
        ans=2*(x+1)*(x+2);

    printf("%lld\n",ans);
    return 0;
}

```