Problem:
Pair of Primes

We arrange the numbers between 1 and N (1 <= N <= 10000) in increasing
order and decreasing order like this:

1 2 3 4 5 6 7 8 9 . . . N
N . . . 9 8 7 6 5 4 3 2 1

Two numbers faced each other form a pair. Your task is to compute the number of pairs P such that both
numbers in the pairs are prime.

Input

Input contains several test cases. Each test case consists of an integer N in
one line.

Output

For each line of input, output P .

Sample Input

1
4
7
51

Output for the Sample Input

0
2
2
6

Solution in JAVA (judge verdict: Wrong Answer)

import java.io.BufferedReader;
import java.io.InputStreamReader;

class Main{
	public static void main(String args[]){
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String str = new String();

		try{

			while((str = br.readLine()) != null){
				int n = Integer.parseInt(str);
				int count = 0;

				if(n <= 2){
					count = 0;
				}else if(n % 2 == 0){
					//nが偶数の場合は，2の相方だけ調べればいい
					if(isPrime(n-1)) count = 2;
				}else{
					// まず2の相方を調べる
					if(isPrime(n-1)) count = 2;

					// 中心の数が素数かどうか調べる
					int middle = (1 + n) / 2;
					if(isPrime(middle)) count++;

					for(int i = 3; i < middle; i += 2){
						System.out.println(i + "\t" + (n+1-i));
						if(isPrime(i)&&isPrime(n+1-i)) count += 2;
					}
				}
				System.out.println(count);
			}

		}catch(Exception e){
			System.err.println(e);
		}
	}

	static boolean isPrime(int n){

		for (int i = 3; i <= n - 1; i += 2){
			if (n % i == 0) {
				return false;
			}
		}
		return true;
	}

	static int gcd(int a, int b){
		if(b == 0){
			return a;
		}else{
			return gcd(b, a % b);
		}
	}
}