//#include <iostream>
#include <bits/stdc++.h>
using namespace std;
ifstream in("curcubeu.in");
ofstream out("curcubeu.out");
const int Max=1000005;
int tata[Max],a[Max],b[Max],c[Max],n,cul[Max];
void find(int &x)
{
    int r=x;
    while(r!=tata[r])
        r=tata[r];
    while(x!=tata[x])
    {
        int q=x;
        x=tata[x];
        tata[q]=r;
    }
}
void uneste(int x,int y)
{
    tata[x]=y;
}
int main()
{
    in>>n>>a[1]>>b[1]>>c[1];
    tata[1]=1; tata[n]=n;
    for(int i=2;i<=n-1;i++)
    {
        tata[i]=i;
        a[i]=(1LL*a[i-1]*i)%n;
        b[i]=(1LL*b[i-1]*i)%n;
        c[i]=(1LL*c[i-1]*i)%n;
    }
    for(int i=n-1;i>=1;i--)
    {
        int st=min(a[i],b[i]); int dr=max(a[i],b[i]); int cl=c[i];
        find(st);
        while(st<=dr)
        {
            if(!cul[st])
            {
                cul[st]=cl;
                uneste(st,dr);
            }
            find(++st);
        }
    }
    for(int i=1;i<=n-1;i++)
        out<<cul[i]<<"\n";
    return 0;
}