#include <map>
#include <ctime>
#include <cmath>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#define spause() system("pause")

using namespace std;
typedef long long llong;
typedef unsigned long long ullong;
typedef pair<int, int> prdd;

const llong inf = 0x7fffffffffffffff;

struct lar {
    prdd l[2][32];
};

int q, k, l1, r1, l2, r2, ans = -1;
prdd is[2];
lar eg[2], ep[2];

bool cml(prdd itv, int lv);
int latml(prdd itv, int lv);
int getlen(prdd itv);
prdd mxlen(prdd x, prdd y);

int main() {
    scanf("%d", &q);
    for (int fq = 0; fq < q; fq++) {
        scanf("%d", &k);
        for (int i = 0; i < 2; i++) scanf("%d%d", &is[i].first, &is[i].second);
        // WARNING: [a, b]
        eg[0].l[0][k] = eg[0].l[1][k] = is[0];
        eg[1].l[0][k] = eg[1].l[1][k] = is[1];
        int a[2];
        for (int i = k; i > 0; i--)
            for (a[0] = 0; a[0] < 2; a[0]++)
                for (a[1] = 0; a[1] < 2; a[1]++) {
                    // printf("%d\t%d\t%d\t%d\t%d\t%d\t%d\t%d\n", i, ans, eg[0].l[a[0]][i].first,
                    // eg[0].l[a[0]][i].second, eg[1].l[a[1]][i].first, eg[1].l[a[1]][i].second,
                    // cml(eg[0].l[a[0]][i], i), cml(eg[1].l[a[1]][i], i));
                    if (cml(eg[0].l[a[0]][i], i) && cml(eg[1].l[a[1]][i], i))
                        ans = max(
                            ans,
                            min(eg[0].l[a[0]][i].second % (1 << i), eg[1].l[a[1]][i].second % (1 << i)) -
                                max(eg[0].l[a[0]][i].first % (1 << i), eg[1].l[a[1]][i].first % (1 << i)));

                    for (int tp = 0; tp < 2; tp++)
                        if (cml(eg[tp].l[a[tp]][i], i)) {
                            prdd lp = prdd(eg[tp].l[a[tp]][i].first, latml(eg[tp].l[a[tp]][i], i) - 1),
                                 rp = prdd(latml(eg[tp].l[a[tp]][i], i) + 1, eg[tp].l[a[tp]][i].second);
                            eg[tp].l[0][i - 1] = mxlen(eg[tp].l[0][i - 1], lp);
                            eg[tp].l[1][i - 1] = mxlen(eg[tp].l[1][i - 1], rp);
                        } else
                            eg[tp].l[a[tp]][i - 1] = mxlen(eg[tp].l[a[tp]][i - 1], eg[tp].l[a[tp]][i]);
                }
        printf("%d\n", ans + 1);
        ans = -1;
        eg[0] = ep[0];
        eg[1] = ep[1];
    }
    spause();
    return 0;
}

bool cml(prdd itv, int lv) {
    if (itv.first == 0)
        return false;
    return (itv.second >> (lv - 1) & 1) - ((itv.first - 1) >> (lv - 1) & 1);
}

int latml(prdd itv, int lv) {
    if (itv.first == 0)
        return 0;
    return (itv.second >> (lv - 1)) << (lv - 1);
}

int getlen(prdd itv) { return itv.second - itv.first; }

prdd mxlen(prdd x, prdd y) {
    if (getlen(x) > getlen(y))
        return x;
    else if (getlen(x) < getlen(y))
        return y;

    if (x.first == 0)
        return y;
    else
        return x;
}