#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

int main() {
    int n;
    while(cin >> n, n) {
        vector<int> v((n+1)/2);
        vector<int> a;
        for (int i = 1; i < n; ++i) {
            a.emplace_back(i*i%n);
        }
        sort(a.begin(), a.end());
        a.erase(unique(a.begin(), a.end()), a.end());
        for (int i = 0; i < a.size(); ++i) {
            for (int j = 0; j < a.size(); ++j) {
                if(i == j) continue;
                int val = (a[i]-a[j]+n)%n;
                if(val > (n-1)/2) val = n-val;
                v[val]++;
            }
        }
        for (int i = 1; i < v.size(); ++i) {
            printf("%d\n", v[i]);
        }
    }
    return 0;
}
