#include <iostream>
#include <vector>
#include <unordered_map>
using namespace std;

// Function to calculate maximum number of operations
int maxOperations(vector<int>& nums) {
    // Map to store the latest position of each number
    unordered_map<int, int> lastPos;
    int ops = 0; // Maximum number of operations
    int lastOpPos = 0; // Position of the last operation

    for (int i = 0; i < nums.size(); ++i) {
        // If the number was seen before and its last position is greater than
        // the last operation position, we can perform an operation
        if (lastPos.count(nums[i]) && lastPos[nums[i]] > lastOpPos) {
            ops++;
            // Update the position of the last operation
            lastOpPos = i;
        }
        // Update the latest position of the current number
        lastPos[nums[i]] = i;
    }

    return ops;
}

int main() {
    int t; // Number of test cases
    cin >> t;
    while (t--) {
        int n;
        cin >> n;
        vector<int> nums(n);
        for (int i = 0; i < n; ++i) {
            cin >> nums[i];
        }
        cout << maxOperations(nums) << '\n';
    }
    return 0;
}