/*
C++ program to calculate A118988
Author: M. Wang
Email Address: atvv@foxmail.com
Compiler: MinGW compiler
Compiler Version: v4.9.2 (tdm64-1)
Compiler Options: -O2 -Wall -Wextra
OEIS URL: https://oeis.org/A118988
Output:
2
2
4
7
15
20
62
190
771
...
*/
#include <iostream>
#include <ctime>
#include <cassert>
#include <cstring>
#include <vector>
#include <string>
#include <set>
#include <map>
using namespace std;

set<unsigned __int64> st;
int row[333][333];
int n;

int str[333];
int invcnt=1;
int perval;

void per_dfs(int k){
	if(k!=n){
		int i;
		invcnt*=row[k][str[k]];
		per_dfs(k+1);
		invcnt*=row[k][str[k]];
		for(i=k+1;i<n;i++){
			invcnt*=row[k][str[i]];
			swap(str[i],str[k]);
			per_dfs(k+1);
			swap(str[i],str[k]);
			invcnt*=row[k][str[i]];
		}
	}
	else{
		perval+=invcnt;
	}
}
void per(){
	perval=0;
	per_dfs(0);
	st.insert(perval);
}
void dfs(int rid,int cid){
	if(cid==n){
		rid++;
		if(rid==n){
			per();
			return;
		}
		cid=rid;
	}
	row[rid][cid]=row[cid][rid]=-1;
	dfs(rid,cid+1);
	row[rid][cid]=row[cid][rid]= 1;
	dfs(rid,cid+1);
}
int main(){
	for(n=1;;n++){
		st.clear();
		int i;
		for(i=0;i<n;i++){
			str[i]=i;
		}
		dfs(0,0);
		printf("%u\n",(unsigned)st.size());
	}
	return 0;
}