BISHOPS - Bishops


Yesterday was Sam's birthday. The most interesting gift was definitely the chessboard. Sam quickly learned the rules of chess and defeated his father, all his friends, his little sister, and now no one wants to play with him any more.

So he decided to play with another birthday gift – a Book of Math Problems for Young Mathematicians. He opened the book somewhere in the middle and read the following problem: "How many knights can be placed on a chessboard without threatening each other?" After a while he realized that this was trivial and moved on to the next problem: "How many bishops can be placed on a chessboard without threatening each other?". Sam is in trouble here. He is not able to solve this problem and needs your help.

Sam's chessboard has size N x N. A bishop can move to any distance in any of the four diagonal directions. A bishop threatens another bishop if it can move to the other bishop's position. Your task is to compute the maximum number of bishops that can be placed on a chessboard in such a way that no two bishops threaten each other.

Input

The input file consists of several lines. The line number i contains a single positive integer N representing the size of the i-th chessboard. [1 <= N <= 10^100]

Output

The output file should contain the same number of lines as the input file. The i-th line should contain one number – the maximum number of bishops that can be placed on i-th chessboard without threatening each other.

Example

Input:
2
3

Output:
2
4


hide comments
jackobek: 2019-04-30 00:21:48

becouse of endl 3 WA

aj_254: 2019-04-23 20:54:36

my 50th on spoj....all 50 in python ... i make myselt the pythonist. checkout my github rajat_254 for spoj python solutions

Aahitagni Mukherjee: 2019-04-19 22:09:53

take care of corner case. Also use C++14 if you're using boost multiprecision library.

alpish1: 2019-03-27 15:45:17

how many inputs do we have to take in this problem its not specified.

adipat: 2019-02-02 10:45:18

Very simple problem, just focus on finding the pattern. If you're using Python, don't use input(), instead use sys.stdin.readlines().

Last edit: 2019-02-02 10:45:26
wasteacc: 2019-01-25 19:42:04

how many inputs should we take ?

indsonu: 2019-01-18 11:25:52

boost multiprecision namespace is not working can anyone suggest why?

Alexander A. Maly: 2019-01-16 19:09:08

@joeyndchandler: n = 0 is prohibited by the problem statement and does not appear in the test cases.

kaotic_lezend: 2018-12-30 11:22:32

Those who are gettin NZEC in java, read carefully. Use try catch block and catch the error NoLineException. I struggled for 3 hours then i found out that it was throwing this exception in the end of the program when it was not finding any input, so just catch that exception and that will provide an AC. //Happy Coding

yogesh1208: 2018-12-11 19:33:27

i am getting NZEC in java


Added by:Roman Sol
Date:2005-04-17
Time limit:1s
Source limit:10000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All
Resource:IPSC 2004