#include<bits/stdc++.h>
#define pb push_back
#define mk make_pair
#define ll long long
#define ss second
#define ff first
#define pll pair<ll,ll>
#define vll vector<ll>
#define mll map<ll,ll>
#define mod 1000000007
#define w(x) ll x; cin>>x; while(x--)
#define ps(x,y) fixed<<setprecision(y)<<x;
#define fo(i, j, k, in) for (ll i=j ; i<k ; i+=in)
#define re(i, j) fo(i, 0, j, 1)
#define pi 3.1415926535897932384626433832795
#define all(cont) cont.begin(), cont.end()
#define countbit(x) __builtin_popcount(x)
#define mod 1000000007
#define lo lower_bound
#define de(n) ll n;cin>>n;
#define def(a,n) ll n;cin>>n;ll a[n];re(i,n){cin>>a[i];}
#define defi(a,n,k) ll n;cin>>n; ll k;cin>>k;ll a[n];re(i,n){cin>>a[i];}
#define deb(x) cout<<#x<<"="<<x<<endl;
#define tr(it,a) for(auto it=a.begin();it!=a.end();it++)
#define nl cout<<endl;

using namespace std;



int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
    
        int n;
        cin>>n;
        int x[2]={1,-1};

        int y[2]={1,-1};
        pair<int,int> p;
        p.first=0;
        p.second=0;
        int a1=n/2;
        int a2=n-n/2;
        if(n%2!=0){
            int c=a2+1;
            int d=(a1+1);
            ll ans=1ll*2*(c*d);
            cout<<ans<<endl;
        }
        else{
            int c=a2+1;
            int d=a1+1;
            ll ans=1ll*c*d;
            cout<<ans<<endl;
        }
      

        

        
        

    


    return 0;
}
