A. Pizza, Pizza, Pizza!!!

time limit per test

1 second

memory limit per test

128 megabytes

input

standard input

output

standard output

Katie, Kuro and Shiro are best friends. They have known each other since kindergarten. That's why they often share everything with each other and work together on some very hard problems.

Today is Shiro's birthday. She really loves pizza so she wants to invite her friends to the pizza restaurant near her house to celebrate her birthday, including her best friends Katie and Kuro.

She has ordered a very big round pizza, in order to serve her many friends. Exactly $n$ of Shiro's friends are here. That's why she has to divide the pizza into $n+1$ slices (Shiro also needs to eat). She wants the slices to be exactly the same size and shape. If not, some of her friends will get mad and go home early, and the party will be over.

Shiro is now hungry. She wants to cut the pizza with minimum of straight cuts. A cut is a straight segment, it might have ends inside or outside the pizza. But she is too lazy to pick up the calculator.

As usual, she will ask Katie and Kuro for help. But they haven't come yet. Could you help Shiro with this problem?

Input

A single line contains one non-negative integer $n$ ($0\le n\le {10}^{18}$) — the number of Shiro's friends. The circular pizza has to be sliced into $n+1$ pieces.

Output

A single integer — the number of straight cuts Shiro needs.

Examples

input

Copy

3

output

Copy

2

input

Copy

4

output

Copy

5

Note

To cut the round pizza into quarters one has to make two cuts through the center with angle ${90}^{\circ }$ between them.

To cut the round pizza into five equal parts one has to make five cuts.

解题说明：此题是一道简单的数学题，切蛋糕问题，分成n+1份，问最少切几刀，分奇偶情况判断。

#include<cstdio>
#include<iostream>
#include<string>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;

int main()
{
	long long int n;
	scanf("%lld", &n);
	if ((n + 1) % 2 == 0 || n == 0)
	{
		printf("%lld", (n + 1) / 2);
	}
	else
	{
		printf("%lld", n + 1);
	}
	return 0;
}