#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<cassert>
#include<iostream>
#include<sstream>
#include<string>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<utility>
#include<numeric>
#include<algorithm>
#include<bitset>
#include<complex>

using namespace std;

typedef long long Int;
typedef vector<int> vint;
typedef pair<int,int> pint;
#define mp make_pair

template<class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cout << *i << " "; cout << endl; }
template<class T> void chmin(T &t, T f) { if (t > f) t = f; }
template<class T> void chmax(T &t, T f) { if (t < f) t = f; }
int in() { int x; scanf("%d", &x); return x; }

int a[10010];
int b[10010];

int main() {
	int n;
	while(n=in()){
		memset(a,0,sizeof(a));
		memset(b,0,sizeof(b));
		int i,j;
		for(i=1;i<n;i++){
			a[i*i%n]=1;
		}
		for(i=0;i<n;i++){
			if(a[i]==0)continue;
			for(j=i+1;j<n;j++){
				if(a[j]==0)continue;
				int k=i-j;
				if(k<0)k+=n;
				if(k>(n-1)/2)k=n-k;
				b[k]+=2;
			}
		}
		for(i=1;i<(n+1)/2;i++)cout<<b[i]<<endl;
	}
	return 0;
}