#include <fstream>

#define DIM 1000005

using namespace std;

ifstream f ("curcubeu.in");
ofstream g ("curcubeu.out");

int a[DIM] , b[DIM] , c[DIM] , ans[DIM] , nxt[DIM];
int n , nr;

int find (int pos) {
    if (nxt[pos] == 0)
        return pos;

    int p = pos;
    while (nxt[pos]) {
        pos = nxt[pos];
    }

    while (p != pos) {
        nxt[p] = pos;
        p = nxt[p];
    }

    return pos;
}

void solve (int left , int right , int val) {
    while (left <= right) {
        if (ans[left] == 0) {
            ans[left] = val;
            if (left != right)
                nxt[left] = right;

            ++nr;
            if (nr == n - 1) {
                return;
            }

            ++left;
        }

        else {
            left = find (left) + 1;
        }
    }
}

int main() {
    f >> n;
    for (int i = 1; i <= n; ++i) {
        f >> a[1] >> b[1] >> c[1];
    }

    for (int i = 2; i < n; ++i) {
        long long aux = ((long long)a[i - 1] * (long long)i) % n;
        a[i] = aux;

        aux = ((long long)b[i - 1] * (long long)i) % n;
        b[i] = aux;

        aux = ((long long)c[i - 1] * (long long)i) % n;
        c[i] = aux;
    }

    for (int i = n - 1; i >= 1; --i) {
        if (a[i] > b[i]) {
            swap (a[i] , b[i]);
        }

        solve (a[i] , b[i] , c[i]);
    }

    for (int i = 1; i < n; ++i) {
        g << ans[i] << '\n';
    }
    return 0;
}