1.
import java.util.Scanner;

/**
* FWP, Ausgewählte Probleme aus dem ACM Programming Contest, SS10
* Problem: 11296 - Counting Solutions to an Integral Equation
* Link: http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=226&page=show_problem&problem=2271
*
* @author Martin Lambeck
* @version 1.0
*
* Method : -
* Status : Accepted
* Runtime: 0.884
*/
public class CountingSolutionsToAnIntegralEquation {

static Scanner in = new Scanner(System.in);

public static void main (String...strings)
{
while (in.hasNextInt())
{
long count = 0;

int n = in.nextInt();

for (int x = 0; x <= n; x++)
{
int nmx = n-x;

if (nmx % 2 > 0)
continue;

nmx /= 2;

count += nmx+1;
}

System.out.println(count);
}

}
}