#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

int a[100010];
int main(void) {
    int T;
    scanf("%d", &T);
    while (T -- > 0) {
        int n;
        scanf("%d", &n);
        for (int i = 0; i < n; ++ i) scanf("%d", a + i);
        sort(a, a + n);

        long long s = 0, t = 0;
        int flag = true;
        for (int i = n - 1; i >= 0; -- i) {
            t += a[i];
            if (i > a[i]) s += i - a[i];
            else if (i < a[i]) {
                if (i + s >= a[i]) {
                    s -= a[i] - i;
                } else {
                    flag = false;
                    break;
                }
            }
        }
        if (t != (long long)n * (n - 1) / 2) flag = false;
        if (flag && s == 0) printf("It seems to have no problem.\n");
        else printf("The data have been tampered with!\n");
    }

    return 0;
}