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

const int MAXN = 50005;
int a[MAXN];

int main()
{
    int T; scanf("%d", &T);
    while (T--)
    {
        int n; scanf("%d", &n);
        int sum = 0;
        for (int i = 0; i < n; i++)
        {
            scanf("%d", &a[i]);
            sum += a[i];
        }
        if (sum != ((n & 1) ? (n - 1) / 2 * n : n / 2 * (n - 1)))
        {
            printf("The data have been tampered with!\n");
            continue;
        }
        sort(a, a + n);
        int t = 0;
        bool flag = true;
        sum = 0;
        for (int i = n - 1; i >= 0; i--)
        {
            t += i;
            sum += a[i];
            if (sum > t)
            {
                flag = false;
                break;
            }
        }
        if (flag) printf("It seems to have no problem.\n");
        else printf("The data have been tampered with!\n");
    }
    return 0;
}