
// Problem: B. Move and Turn
// Contest: Codeforces - Codeforces Round #691 (Div. 2)
// URL: https://codeforces.com/contest/1459/problem/B
// Memory Limit: 512 MB
// Time Limit: 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)

#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define forn(i,x,n) for(int i = x;i <= n;++i)	

typedef pair<int,int> pii;
#define x first
#define y second
int n;
set<pii> st;
void dfs(int x,int y,int dir,int d)
{
	if(d == n)
	{
		st.insert({x,y});
		return ;
	}
	if(dir == 1)
	{
		dfs(x,y - 1,2,d + 1);
		dfs(x,y + 1,2,d + 1);
	}
	if(dir == 2)
	{
		dfs(x + 1,y,1,d + 1);
		dfs(x - 1,y,1,d + 1);
	}
}
int main()
{
	scanf("%d",&n);
	if(n % 2 == 0)	printf("%d",(n / 2 + 1) * (n / 2 + 1));
   	else
   	{
   		ll res = 0,fact = 4;
   		for(int i = 1;i <= n;i += 2)
   		{
   			res += fact;
   			fact += 4;
   		}
   		printf("%lld",res);
   	}
    return 0;
}
