#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>

using namespace std;

#define FOR(i,a,b) for(long long i=(a);i<(b);i++)
#define REP(i,N) for(long long i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define fi first
#define se second

#define PI acos(-1.0)
#define INF 1000000007
#define EPS 1e-10
#define MAX_M 100100

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<double, double> PD;
typedef pair<string, ll> PS;
typedef vector<ll> V;
typedef pair<P, char> PC;

int n;

int is_prime[11000];

int main(){
	REP(i, 11000)is_prime[i] = 1;
	is_prime[0] = is_prime[1] = 0;
	for (int i = 2; i <= 10000; i++){
		if (is_prime[i]){
			for (int j = i * 2; j <= 10000; j += i)is_prime[j] = 0;
		}
	}

	while (cin >> n){
		int ans = 0;
		FOR(i, 1, n + 1){
			if (is_prime[i] && is_prime[n + 1 - i])ans++;
		}
		cout << ans << endl;
	}
}