#include<iostream>
#include<cstdio>
using namespace std;
int A[1000],n,t;
string str;
bool is_p(int x){
	if(x==0)return 0;
	for(int i=2;i*i<=x;i++)
		if(x%i==0)return 0;
	return 1;
}
void printf(){
	for(int i=0;i<n;i++)cout<<A[i]<<" ";
	cout<<endl;
}
void dfs(int cur){
	if(cur==n){
		printf();
		t++;
	}
	else for(int i=1;i<=n;i++){
		int ok=1;
		for(int j=0;j<cur;j++)
			if(A[j]==i)ok=0;
		if(ok&&(is_p(A[cur-1]+i)||cur==0)){
			A[cur]=i;
			dfs(cur+1);
		}
	}
}
int main(){
	freopen("dfs3.in","r",stdin);
	freopen("dfs3.out","w",stdout);
	cin>>n;
	dfs(0);
	cout<<t<<endl;
	return 0;
}