#include<iostream>
#include<cstdio>
using namespace std;
int a[20],vis[20],n,ans;
bool isp(int n){
	for(int i=2;i*i<=n;i++)
	if(n%i==0)return 0;
	return 1;
}
void dfs(int cur){
	for(int i=1;i<=n;i++)
	if(!vis[i]&&isp(i+a[cur-1])){
		a[cur]=i;
		vis[i]=1;
		if(cur==n){
			ans++;
			for(int j=1;j<=n;j++){
				cout<<a[j]<<" ";
			}
			cout<<endl;
		}
		else dfs(cur+1);
		vis[i]=0;
	}
}
int main(){
	freopen("dfs3.in","r",stdin);
	freopen("dfs3.out","w",stdout);
	cin>>n;
	dfs(1);
	cout<<ans;
	fclose(stdin);
	fclose(stdout);
	return 0;
}