#include <bits/stdc++.h>

using i64 = int64_t;

namespace stdr = std::ranges;
namespace stdv = std::views;

void solve() {
    int n;
    std::cin >> n;

    std::vector<int> p(n), nxt(n, -1);

    for (int i = 0; i < n; i++) {
        std::cin >> p[i];
        p[i]--;
    }

    for (int i = 0; i + 1 < n; i++) {
        if (p[i + 1] != p[i] + 1) {
            nxt[p[i]] = p[i + 1];
        }
    }

    std::vector<bool> vis(n);
    for (int i = 0; i < n; i++) {
        if (vis[i]) {
            continue;
        }
        int cnt = 1;
        while (i != -1 && !vis[i]) {
            vis[i] = true;
            i = nxt[i];
            cnt++;
        }
        if (cnt >= 4) {
            std::cout << "No\n";
            return;
        }
    }

    std::cout << "Yes\n";
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    int t;
    std::cin >> t;

    while (t--) {
        solve();
    }

    return 0;
}