#include <bits/stdc++.h>
#define ff first
#define ss second
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef array<int, 3> tiii;

const int SZ = 1 << 20;
ll A[SZ];
ll B[SZ];
ll C[SZ];
ll D[SZ];
vector<int> lA[SZ];
vector<int> lB[SZ];
vector<int> lC[SZ];
vector<int> lD[SZ];

void f(unsigned long long seed, ll *arr)
{
    typedef unsigned long long uint64;
    uint64 state[2] = { seed, seed ^ 0x7263d9bd8409f526 };
    for(int i = 0; i < SZ; ++i)
    {
        uint64 s0 = state[0];
        uint64 s1 = state[1];
        uint64 result = s0 + s1;
        s1 ^= s0;
        state[0] = ((s0 << 55) | (s0 >> 9)) ^ s1 ^ (s1 << 14);
        state[1] = (s1 << 36) | (s1 >> 28);
        arr[i] = ll(result & ((1ull << 50) - 1));
    }
}

mt19937 rnd(1557);
int rng(int l, int r) { return uniform_int_distribution<int>(l, r)(rnd); }

int main() 
{
    cin.tie(0); ios_base::sync_with_stdio(0);
    
    int n; cin >> n;
    unsigned long long a, b, c, d; cin >> a >> b >> c >> d;
    
    f(a, A);
    f(b, B);
    f(c, C);
    f(d, D);
    // for(int i = 0; i < 20; ++i) cout << A[i] << ' '; cout << endl;
    // for(int i = 0; i < 20; ++i) cout << B[i] << ' '; cout << endl;
    // for(int i = 0; i < 20; ++i) cout << C[i] << ' '; cout << endl;
    // for(int i = 0; i < 20; ++i) cout << D[i] << ' '; cout << endl;

    int N = SZ;
    ll msk = (1 << 20) - 1;
    for(int i = 0; i < N; ++i) lA[A[i] & msk].push_back(i);
    for(int i = 0; i < N; ++i) lB[B[i] & msk].push_back(i);
    for(int i = 0; i < N; ++i) lC[C[i] & msk].push_back(i);
    for(int i = 0; i < N; ++i) lD[D[i] & msk].push_back(i);

    int x;
    while(1)
    {
        x = rng(0, (1 << 20) - 1);

        ll a = 0, b = 0;
        for(int i = 0; i < N; ++i) a += (ll)lA[i].size() * (ll)lB[i ^ x].size();
        for(int i = 0; i < N; ++i) b += (ll)lC[i].size() * (ll)lD[i ^ x].size();
        // cout << a << ' ' << b << endl;
        if(a > (ll)3e5 && b > (ll)3e5) break;
    }

    vector<tiii> X;
    for(int i = 0; i < N; ++i)
    {
        for(int j : lA[i])
        {
            for(int k : lB[i ^ x])
            {
                assert(((A[j] ^ B[k]) & msk) == x);
                X.push_back({ int((A[j] ^ B[k]) >> 20), j, k });
                if(X.size() >= SZ) break;
            }
            if(X.size() >= SZ) break;
        }
        if(X.size() >= SZ) break;
    }

    sort(X.begin(), X.end());

    for(int i = 0; i < N; ++i)
    {
        for(int j : lC[i]) for(int k : lD[i ^ x])
        {
            int tar = (C[j] ^ D[k]) >> 20;
            auto it = lower_bound(X.begin(), X.end(), tiii{ tar, -1, -1 });
            if(it != X.end() && (*it)[0] == tar)
            {
                cout << (*it)[1] + 1 << ' ' << (*it)[2] + 1 << ' ' << j + 1 << ' ' << k + 1;
                return 0;
            }
        }
    }

    assert(false);
}