#include <bits/stdc++.h>
#include <queue> 
#define ll long long
using namespace std;

inline int read()
{
    int ret = 0, sgn = 1;
    char ch = getchar();
    while (ch < '0' || ch > '9')
    {
        if (ch == '-')
            sgn = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9')
    {
        ret = ret * 10 + ch - '0';
        ch = getchar();
    }
    return ret * sgn;
}
inline void write(int x) //ê?3?ía1ò
{
    if (x >= 10)
        write(x / 10);
    putchar(x % 10 + '0');
}

///快速幂m^k%mod
ll qpow(ll x, ll n, ll mod)
{
    ll num = 1;
    while (n)
    {
        if (n & 1)
            num = (num * x) % mod;
        x = x * x % mod, n >>= 1;
    }
    return num;
}
int main(){
	ll T;
	cin>>T;
	ll ans;
	if(T%2==0){
		if(T==2){
			cout<<4<<endl;

		} else {
			ans=(T/2+1);
			ans=ans*ans;
			cout<<ans<<endl;
		}
	}else{
		ans=(T+1)/2;
		ans=2*ans*(ans+1);
		cout<<ans<<endl;
	}
	return 0;
}