#include <iostream>
#include <vector>

using namespace std;


int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.precision(10);
    cout << fixed;

    int t;
    cin >> t;

    while (t--) {
        int n;
        cin >> n;
        bool isPermutation = true;
        int a[n];
        for (int i = 0; i < n; ++i) {
            cin >> a[i];
        }
        vector<int> list;
        for (int i = 0; i < n; ++i) {
            if (a[i] > n) {
                cout << "NO" << endl;
                isPermutation = false;
            }
            __wrap_iter<int *> doesExistInList = find(list.begin(), list.end(), a[i]);
            if (doesExistInList != list.end()) {
                cout << "NO" << endl;
                isPermutation = false;
            } else {
                list.push_back(a[i]);
            }
        }
        if (isPermutation) {
            cout << "YES" << endl;
        }
    }


    return 0;
}