# define _CRT_SECURE_NO_WARNINGS 1
# include <iostream>
# include <numeric>
# include <string>
# include <bitset>
# include <vector>
# include <algorithm>
# include <cstdlib>
# include <cstdio>
# include <cstring>
# include <cstdlib>
# include <iomanip>
# include <queue>
# include <sstream>
# include <climits>
# include <cmath>
# include <list>
# include <functional>
# include <string>
# include <ctime>
# include <set>
# include <forward_list>
# include <map>
# include <stack>
using namespace std;

# define INF ((int)(1<<30))
# define REP(i,n) for(int i=0;i<(int)n;i++)
# define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)
# define TORAD 2.0*M_PI/360.0
# define INT(x) int x;cin>>x;
# define ALL(x) (x).begin(),(x).end()
# define RALL(x) (x).rbegin(),(x).rend()
# define DEBUG(x) cout<<#x<<" :"<<x<<endl;
# define EPS 1e-12

template<class T> void debug(T a) { for (auto i : a)cout << i << endl; }

typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
int dx[4] = { 0,1,0,-1 }, dy[4] = { -1,0,1,0 };


int main()
{
	int n;
	while (cin >> n&&n)
	{
		set<int> a;
		for (int i = 1; i<n; i++)
		{
			long long x = (long long)i*i;
			x %= n;
			a.insert(x);
		}
		int ans[11000] = {};
		for (auto it : a)
		{
			for (auto i : a)
			{
				if (i == it)continue;
				int d = i - it;
				while (d<0)d += n;
				while (d>(n - 1) / 2)d = n - d;
				while (d<0)d += n;
				while (d>(n - 1) / 2)d = n - d;
				ans[d]++;
			}
		}
		for (int i = 1; i <= (n - 1) / 2; i++)
		{
			cout << ans[i] << endl;
		}
	}
}