#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <vector>
#define gc getchar
#define pc putchar
#define rep(i, a, b) for (int i = (a); i <= (b); i ++ )
#define rop(i, a, b) for (int i = (a); i < (b); i ++ )
#define dep(i, a, b) for (int i = (a); i >= (b); i -- )

using namespace std;

const int N = 100010;
const int mod = 998244353; int T = 1;
void read() { return; } template <typename T, typename ...T2> void read(T &s, T2 &...oth) { s = 0; char ch = gc(); bool f = 0; for (; ch < '0' or ch > '9'; ch = gc()) if (ch == '-') f = 1; for (; ch >= '0' and ch <= '9'; ch = gc()) s = (s << 1) + (s << 3) + (ch ^ 48); s = f ? -s : s; read(oth...); return; }
void write(char ch) { return; } template <typename T, typename ...T2> void write(char ch, T s, T2 ...oth) { if (!s) { pc('0'); pc(ch); write(ch, oth...); return; } int stk[100], top = 0; if (s < 0) pc('-'), s = ~s + 1; while (s) stk[ ++ top] = s % 10, s /= 10; do pc(stk[top -- ] + (1 << 4) + (1 << 5)); while (top); pc(ch); write(ch, oth...); return; }
int qpow(int a, int b = mod - 2, int s = 1) { for (; b; b >>= 1, a = a * a % mod) if (b & 1) s = s * a % mod; return s; }

int n, t[N], b[N], f[1010][1 << 8][16];
void sub(int ans = 0x3f3f3f3f) {
	read(n); rep(i, 1, n) read(t[i], b[i]);
	memset(f, 0x3f, sizeof f); f[1][0][7] = 0;
	rep(i, 1, n) rop(j, 0, (1 << b[i] + 1)) rep(k ,-8, b[i]) {
		if (j & 1) f[i + 1][j >> 1][k + 7] = min(f[i + 1][j >> 1][k + 7], f[i][j][k + 8]);
		else {
			int lim = n + 10;
			rep(o, 0, b[i]) if (!((j >> o) & 1)) {
				if (i + o > lim) break;
				lim = min(lim, i + o + b[i + o]);
				f[i][j | (1 << o)][o + 8] = min(f[i][j | (1 << o)][o + 8], f[i][j][k + 8] 
					+ (i + k ? (t[i + k] ^ t[i + o]) : 0));
			}
		}
	} rep(i, 0, 8) ans = min(ans, f[n + 1][0][i]); write('\n', ans);
}
signed main() { read(T); while (T -- ) sub(); return 0; }