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 JAVA):

Solution:
//package dataStructures;

import java.util.*;
import java.lang.*;
import java.io.*;

public class newTest3 {

	public static void main(String[] args) {
		FastReader sc = new FastReader();
//		int t=sc.nextInt();
//		StringBuffer ans = new StringBuffer("");
//		while(t-->0) {
//			
//		}
//		System.out.println(ans);
		int n = sc.nextInt();
		int m = (n/2)+1;
		if (n%2==0 ) {
			System.out.println(m*m);
		}else {
			System.out.println(m*(m+1)*2);
		}
	}
	
	static int fib(int n) {						//nth Fibonacci number in O(1) time.
		double phi = (1+Math.sqrt(5))/2;
		return (int) Math.round(Math.pow(phi,n)/Math.sqrt(5));
	}
	
	static long nCr(long n,long r) {
		if(n<r) return 0;
		if(r > n - r) r = n - r; // because nCr(n, r) == nCr(n, n - r)
	    long ans = 1;
	    for(int i = 1; i <= r; i++) {
	        ans *= n - r + i;
	        ans /= i;
	    }
	    return ans;
	}
	
	static class Pair implements Comparable<Pair>{			//Pair Class
		int x;
		int y;
		Pair(int x,int y){
			this.x=x;this.y=y;
		}
		@Override
		public int compareTo(Pair o) {
			// TODO Auto-generated method stub
			return this.x-o.x;
		}
		
	}
	
	static class Trip<E,T,Z> {			//Triplet Class
		E x;
		T y;
		Z z;
		Trip(E x,T y,Z z){
			this.x=x;
			this.y=y;
			this.z=z;
		}
		public boolean equals(Object o) {
			if(o instanceof Trip) {
				Trip t = (Trip)o;
				return t.x==x&&t.y==y&&t.z==z;
			}
			return false;
		}
		public int hashCode() {
			return new Integer((int)x).hashCode()*62+new Integer((int)y).hashCode()*31+new Integer((int)z).hashCode();
		}
	}

	
	
	static class FastReader 
    { 
        BufferedReader br; 
        StringTokenizer st; 
  
        public FastReader() 
        { 
            br = new BufferedReader(new
                     InputStreamReader(System.in)); 
        } 
  
        String next() 
        { 
            while (st == null || !st.hasMoreElements()) 
            { 
                try
                { 
                    st = new StringTokenizer(br.readLine()); 
                } 
                catch (IOException  e) 
                { 
                    e.printStackTrace(); 
                } 
            } 
            return st.nextToken(); 
        } 
  
        int nextInt() 
        { 
            return Integer.parseInt(next()); 
        } 
  
        long nextLong() 
        { 
            return Long.parseLong(next()); 
        } 
  
        double nextDouble() 
        { 
            return Double.parseDouble(next()); 
        } 
  
        String nextLine() 
        { 
            String str = ""; 
            try
            { 
                str = br.readLine(); 
            } 
            catch (IOException e) 
            { 
                e.printStackTrace(); 
            } 
            return str; 
        } 
    } 

}