//-->FIVAR_RoX   #include <bits/stdc++.h>   #include <vector>   #include <set>   #include <string>   #include <queue>   #define lli long long int   #define ld long double   //loops   #define dfloop(count1,count2,count3) for(lli i=count1;i>count2;i+=count3)   #define floop(count1,count2,count3) for(lli i=count1;i<count2;i+=count3)   #define floop1(count1,count2,count3) for(lli j=count1;j<count2;j+=count3)   #define vfloop(count1,count2,count3,i) for(lli i=count1;i<count2;i+=count3)   #define dvfloop(count1,count2,count3,i) for(lli i=count1;i>count2;i+=count3)   //outputs   #define qwe(x) cout<<x<<endl;   #define qw(x) cout<<x<<    ;   //for inputs   #define in(x) lli x; cin>>x;   #define make(a,x) lli a[x]; floop(0,x,1) cin>>a[i];   #define make1(a,x,y) lli a[x][y]; floop(0,x,1) floop1(0,y,1) cin>>a[i][j];   //for pairs   #define mkp make_pair   #define fst first   #define scd second   //vectors   #define pb push_back   //sets   #define sloop(s,i) for(auto i=s.begin();i!=s.end();i++)      using namespace std;   lli sum(lli* a,lli n){       lli s=0;       while(n--){           s+=a[n];    }       return s;   }   void print_Vector(vector<lli> Vec)    {        for (lli i = 0; i < Vec.size(); i++) {            cout << Vec[i] <<    ;        }        cout << endl;        return;    }    lli min_array(lli* a,lli n){       lli maxi=INT_MAX;       for (int i=0;i<n;i++){           if (maxi>a[i]) maxi=a[i];       }       return maxi;   }      void print_array(lli* a,lli n)   {       for (int i=0;i<n;i++){           cout<<a[i]<<   ;       }       cout<<endl;   }      void answer_fin(){       in(n)       lli k=n/2,k1,m1;       lli m=n-k;       k1=k+1;       m1=m+1;       lli ans;       if(n&1){           ans=k1*m1*2;       }       else ans=k1*m1;       qwe(ans)   }      int main()   {       lli test=1;      // cin>>test;       while(test--)       answer_fin();   }   