#include <bits/stdc++.h>
using namespace std;
ifstream fcin("curcubeu.in");
ofstream fcout("curcubeu.out");

const int N = 1e6 + 5;
int n, a, b, c, mx, mn;

struct elem
{
    int c, i;
} v[N], f[N];

bool operator <(elem a, elem b)
{
    return a.i < b.i;
}

int main()
{
    fcin >> n >> a >> b >> c;
    mn = min(a, b);
    mx = max(a, b);
    v[1] = {c, mn};
    f[1] = {c, mx + 1};
    for (int i = 2; i < n; i++)
    {
        a = (1ll * a * i) % n;
        b = (1ll * b * i) % n;
        c = (1ll * c * i) % n;
        mn = min(a, b);
        mx = max(a, b);
        v[i] = {c, mn};
        f[i] = {c, mx + 1};
    }
    sort(v + 1, v + n + 1);
    sort(f + 1, f + n + 1);
    for (int i = 1; i < n; i++)
    {

    }
    return 0;
}