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.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

inline ll read() {
    ll sum = 0, ff = 1;
    char ch = getchar();
    while(ch < '0' || ch > '9') {
        if(ch == '-') {
            ff = -1;
        }
        ch = getchar();
    }
    while(ch >= '0' && ch <= '9') {
    	sum = sum * 10 + ch - 48;
        ch = getchar();
    }
    return sum * ff;
}

void write(ll x) {
	if(x < 0)
	    putchar('-'), x = -x;
	if(x > 9)
		write(x / 10);
	putchar(x % 10 + '0');
}

const int N = 3007;
const int dx[] = {0, -1, 0, 1, 0};
const int dy[] = {0, 0, 1, 0, -1};
bool vis[N][N];
int ans, cnt, n;
struct node {
	int x, y, way, step;
};
queue<node>q;

//void bfs() {
//	ans = 0;
//	cnt = 0;
//	memset(vis, false, sizeof(vis));
//	while(!q.empty())
//		q.pop();
//	for(int i = 1; i <= 4; i++)
//		q.push((node){1000, 1000, i, 0});
//	while(!q.empty()) {
//		cnt++;
//		node now = q.front();
//		q.pop();
//		
//		if(now.step == n) {
//			if(!vis[now.x][now.y])
//				vis[now.x][now.y] = true, ++ans;
//			continue;
//		}
//		
//		q.push((node){now.x + dx[now.way], now.y + dy[now.way], ((now.way - 1 == 0) ? 4 : now.way - 1), now.step + 1});
//		q.push((node){now.x + dx[now.way], now.y + dy[now.way], ((now.way + 1 == 5) ? 1 : now.way + 1), now.step + 1});
//	}
//}

int main() {
//  	freopen(".in", "r", stdin);
//  	freopen(".out", "w", stdout);
//	for(n = 1; n <= 10; n++) {
//		bfs();
//		write(ans), puts("");	
//}	
	n = read();
	if(n & 1)
		write((n + 1) * ((n + 1) / 2 + 1));
	else
		write((n / 2 + 1) * (n / 2 + 1));
    return 0;
}