Problem: You are given a sequence a_1, a_2, …, a_n of non-negative integers.

You need to find the largest number m of triples (i_1, j_1, k_1), (i_2, j_2, k_2), ..., (i_m, j_m, k_m) such that:

  * 1 ≤ i_p < j_p < k_p ≤ n for each p in 1, 2, …, m;
  * a_{i_p} = a_{k_p} = 0, a_{j_p} ≠ 0;
  * all a_{j_1}, a_{j_2}, …, a_{j_m} are different;
  * all i_1, j_1, k_1, i_2, j_2, k_2, …, i_m, j_m, k_m are different.

Input

The first line of input contains one integer t (1 ≤ t ≤ 500 000): the number of test cases.

The first line of each test case contains one integer n (1 ≤ n ≤ 500 000).

The second line contains n integers a_1, a_2, …, a_n (0 ≤ a_i ≤ n).

The total sum of n is at most 500 000.

Output

For each test case, print one integer m: the largest number of proper triples that you can find.

Example

Input


8
1
1
2
0 0
3
0 1 0
6
0 0 1 2 0 0
6
0 1 0 0 1 0
6
0 1 3 2 0 0
6
0 0 0 0 5 0
12
0 1 0 2 2 2 0 0 3 3 4 0


Output


0
0
1
2
1
1
1
2

Note

In the first two test cases, there are not enough elements even for a single triple, so the answer is 0.

In the third test case we can select one triple (1, 2, 3).

In the fourth test case we can select two triples (1, 3, 5) and (2, 4, 6).

In the fifth test case we can select one triple (1, 2, 3). We can't select two triples (1, 2, 3) and (4, 5, 6), because a_2 = a_5.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using li = __int128;
using uli = unsigned __int128;
using ld = long double;
using pii = pair<int, int>;
using vi = vector<int>;
void doReplace() {}
template <typename T, typename U, typename... Vs>
void doReplace(T& t, const U& u, Vs&&... vs) {
  t = u;
  doReplace(vs...);
}
template <typename T, typename... Us>
T minim(T& was, const T& cand, Us&&... us) {
  if (was > cand) {
    was = cand;
    doReplace(us...);
  }
  return was;
}
template <typename T, typename... Us>
T maxim(T& was, const T& cand, Us&&... us) {
  if (was < cand) {
    was = cand;
    doReplace(us...);
  }
  return was;
}
template <typename D>
D dPower(D base, ll exponent) {
  if (exponent < 0) {
    return dPower(1 / base, -exponent);
  }
  if (exponent == 0) {
    return 1;
  }
  if ((exponent & 1) == 1) {
    return dPower(base, exponent - 1) * base;
  } else {
    D res = dPower(base, exponent >> 1);
    return res * res;
  }
}
class NumberIterator : iterator<forward_iterator_tag, int> {
 public:
  int v;
  NumberIterator(int v) : v(v) {}
  operator int&() { return v; }
  int operator*() { return v; }
};
class range : pii {
 public:
  range(int begin, int end) : pii(begin, max(begin, end)) {}
  range(int n) : pii(0, max(0, n)) {}
  NumberIterator begin() { return first; }
  NumberIterator end() { return second; }
};
template <typename T>
class NeedFill {
  struct Fallback {
    int begin;
  };
  struct Derived : T, Fallback {};
  template <typename U, U>
  struct Check;
  typedef char Yes[1];
  typedef char No[2];
  template <typename U>
  static No& func(Check<int Fallback::*, &U::begin>*);
  template <typename U>
  static Yes& func(...);

 public:
  enum { value = sizeof(func<Derived>(0)) == sizeof(Yes) };
};
template <>
class NeedFill<int> {
 public:
  const static bool value = false;
};
template <>
class NeedFill<bool> {
 public:
  const static bool value = true;
};
template <>
class NeedFill<ll> {
 public:
  const static bool value = false;
};
template <>
class NeedFill<double> {
 public:
  const static bool value = false;
};
template <>
class NeedFill<ld> {
 public:
  const static bool value = false;
};
template <>
class NeedFill<char> {
 public:
  const static bool value = false;
};
template <typename T>
class arr {
  T* b;
  int n;
  void allocate(int sz) {
    n = sz;
    if (sz > 0) {
      b = (T*)(::operator new(sz * sizeof(T)));
    } else {
      b = nullptr;
    }
  }

 public:
  arr(int n = 0) {
    allocate(n);
    if (NeedFill<T>::value) {
      for (int i : range(n)) {
        ::new ((void*)(b + i)) T;
      }
    }
  }
  arr(int n, const T& init) {
    allocate(n);
    for (int i : range(n)) {
      ::new ((void*)(b + i)) T(init);
    }
  }
  arr(T* b, int n) : arr(b, b + n) {}
  arr(T* b, T* e) : b(b), n(e - b) {}
  arr(initializer_list<T> l) : arr(l.size()) {
    if (n > 0) {
      memcpy(b, l.begin(), n * sizeof(T));
    }
  }
  int size() const { return n; }
  T* begin() { return b; }
  const T* begin() const { return b; }
  T* end() { return b + n; }
  const T* end() const { return b + n; }
  arr<T> clone() const {
    arr<T> res(n);
    copy(b, b + n, res.begin());
    return res;
  }
  T& operator[](int at) { return b[at]; }
  const T& operator[](int at) const { return b[at]; }
  bool operator==(const arr& other) const {
    if (n != other.n) {
      return false;
    }
    for (int i : range(n)) {
      if (b[i] != other.b[i]) {
        return false;
      }
    }
    return true;
  }
  vector<T> view() { return vector<T>(b, b + n); }
};
void decreaseByOne() {}
template <typename T, class... Vs>
void decreaseByOne(arr<T>& array, Vs&... vs) {
  int n = array.size();
  for (int i : range(n)) {
    array[i]--;
  }
  decreaseByOne(vs...);
}
template <typename T>
class arr2d {
  T* b;
  int d1;
  int d2;
  int sz;
  void allocate(int n) {
    if (n > 0) {
      b = (T*)(::operator new(n * sizeof(T)));
    } else {
      b = nullptr;
    }
  }

 public:
  arr2d(int d1 = 0, int d2 = 0) : d1(d1), d2(d2), sz(d1 * d2) {
    allocate(sz);
    if (NeedFill<T>::value) {
      for (int i : range(sz)) {
        ::new ((void*)(b + i)) T;
      }
    }
  }
  arr2d(int d1, int d2, const T& init) : d1(d1), d2(d2), sz(d1 * d2) {
    allocate(sz);
    for (int i : range(sz)) {
      ::new ((void*)(b + i)) T(init);
    }
  }
  arr2d(T* b, int d1, int d2) : b(b), d1(d1), d2(d2), sz(d1 * d2) {}
  int size() const { return sz; }
  int dim1() const { return d1; }
  int dim2() const { return d2; }
  T* begin() { return b; }
  T* end() { return b + sz; }
  T& operator()(int i1, int i2) { return b[i1 * d2 + i2]; }
  const T& operator()(int i1, int i2) const { return b[i1 * d2 + i2]; }
  T& operator[](const pii& p) { return operator()(p.first, p.second); }
  const T& operator[](const pii& p) const {
    return operator()(p.first, p.second);
  }
  arr<T> operator[](int at) { return arr<T>(b + at * d2, d2); }
  vector<vector<T>> view() {
    vector<vector<T>> res(min(d1, 50));
    for (int i : range(res.size())) {
      res[i] = (*this)[i].view();
    }
    return res;
  }
};
inline bool isWhitespace(int c) { return isspace(c) || c == EOF; }
class Input {
 private:
  bool exhausted = false;
  int bufSize = 4096;
  char* buf = new char[bufSize];
  int bufRead = 0;
  int bufAt = 0;

 public:
  inline int get() {
    if (exhausted) {
      return EOF;
    }
    if (bufRead == bufAt) {
      bufRead = fread(buf, sizeof(char), bufSize, stdin);
      bufAt = 0;
    }
    if (bufRead == bufAt) {
      exhausted = true;
      return EOF;
    }
    return buf[bufAt++];
  }
  inline int peek() {
    if (exhausted) {
      return EOF;
    }
    if (bufRead == bufAt) {
      bufRead = fread(buf, sizeof(char), bufSize, stdin);
      bufAt = 0;
    }
    if (bufRead == bufAt) {
      exhausted = true;
      return EOF;
    }
    return buf[bufAt];
  }

 private:
  template <typename T>
  inline T readInteger() {
    int c = skipWhitespace();
    int sgn = 1;
    if (c == '-') {
      sgn = -1;
      c = get();
    }
    T res = 0;
    do {
      if (!isdigit(c)) {
        return sgn * res;
      }
      res *= 10;
      res += c - '0';
      c = get();
    } while (!isWhitespace(c));
    return res * sgn;
  }
  void initArrays(int) {}
  template <typename T, class... Vs>
  void initArrays(int n, arr<T>& array, Vs&... vs) {
    array = arr<T>(n);
    initArrays(n, vs...);
  }
  template <typename T, class... Vs>
  void initArrays(int n, vector<T>&, Vs&... vs) {
    initArrays(n, vs...);
  }
  void readImpl(int) {}
  template <typename T, class... Vs>
  void readImpl(int i, arr<T>& arr, Vs&... vs) {
    arr[i] = readType<T>();
    readImpl(i, vs...);
  }
  template <typename T, class... Vs>
  void readImpl(int i, vector<T>& arr, Vs&... vs) {
    arr.push_back(readType<T>());
    readImpl(i, vs...);
  }

 public:
  inline int skipWhitespace() {
    int c;
    while (isWhitespace(c = get()) && c != EOF)
      ;
    return c;
  }
  inline int peekNext() {
    while (isWhitespace(peek()) && peek() != EOF) {
      get();
    }
    return peek();
  }
  inline int readInt() { return readInteger<int>(); }
  inline ll readLong() { return readInteger<ll>(); }
  inline unsigned readUnsigned() { return readInteger<unsigned>(); }
  string readString() {
    int c = skipWhitespace();
    if (c == EOF) {
      return "";
    }
    string res;
    do {
      res.push_back(c);
    } while (!isWhitespace(c = get()));
    return res;
  }
  arr<int> readIntArray(int size) { return readArray<int>(size); }
  arr<ll> readLongArray(int size) { return readArray<ll>(size); }
  arr<double> readDoubleArray(int size) { return readArray<double>(size); }
  arr<string> readStringArray(int size) { return readArray<string>(size); }
  arr<char> readCharArray(int size) { return readArray<char>(size); }
  template <typename T>
  T readType() {
    throw "Operation not supported";
  }
  template <typename U, typename V>
  pair<U, V> readType() {
    U first = readType<U>();
    V second = readType<V>();
    return make_pair(first, second);
  }
  template <typename T>
  arr<T> readArray(int n) {
    arr<T> res(n, T());
    for (int i : range(n)) {
      res[i] = readType<T>();
    }
    return res;
  }
  template <class... Vs>
  void readArrays(int n, Vs&... vs) {
    initArrays(n, vs...);
    for (int i : range(n)) {
      readImpl(i, vs...);
    }
  }
  template <typename U, typename V>
  arr<pair<U, V>> readArray(int n) {
    arr<pair<U, V>> res(n);
    for (int i : range(n)) {
      res[i] = readType<U, V>();
    }
    return res;
  }
  template <typename T>
  arr2d<T> readTable(int rows, int cols) {
    arr2d<T> result(rows, cols);
    for (int i : range(rows)) {
      for (int j : range(cols)) {
        result(i, j) = readType<T>();
      }
    }
    return result;
  }
  arr2d<int> readIntTable(int rows, int cols) {
    return readTable<int>(rows, cols);
  }
  arr2d<char> readCharTable(int rows, int cols) {
    return readTable<char>(rows, cols);
  }
  string readLine() {
    int c = get();
    if (c == EOF) {
      return "";
    }
    string res;
    do {
      res.push_back(c);
      c = get();
    } while (c != '\n' && c != '\r' && c != EOF);
    return res;
  }
  inline double readDouble() {
    int c = skipWhitespace();
    int sgn = 1;
    if (c == '-') {
      sgn = -1;
      c = get();
    }
    double res = 0;
    do {
      if (tolower(c) == 'e') {
        return sgn * res * dPower(double(10), readInt());
      }
      if (!isdigit(c)) {
        return sgn * res;
      }
      res *= 10;
      res += c - '0';
      c = get();
    } while (!isWhitespace(c) && c != '.');
    if (c == '.') {
      double add = 0;
      int length = 0;
      c = get();
      do {
        if (tolower(c) == 'e') {
          return sgn * (res + add * dPower(double(10), -length)) *
                 dPower(double(10), readInt());
        }
        if (!isdigit(c)) {
          res += add * dPower(10, -length);
          return res * sgn;
        }
        add *= 10;
        add += c - '0';
        length++;
        c = get();
      } while (!isWhitespace(c));
      res += add * dPower(double(10), -length);
    }
    return res * sgn;
  }
  inline char readChar() {
    int c = skipWhitespace();
    if (c == EOF) {
      return 0;
    }
    return c;
  }
  inline bool isExhausted() { return exhausted; }
  inline void setBufSize(int newBufSize) {
    if (newBufSize > bufSize) {
      char* newBuf = new char[newBufSize];
      memcpy(newBuf, buf, bufSize);
      buf = newBuf;
    }
    bufSize = newBufSize;
  }
};
template <>
inline double Input::readType() {
  return readDouble();
}
template <>
inline int Input::readType() {
  return readInt();
}
template <>
inline ll Input::readType() {
  return readLong();
}
template <>
inline unsigned Input::readType() {
  return readUnsigned();
}
template <>
inline char Input::readType() {
  return readChar();
}
template <>
inline string Input::readType() {
  return readString();
}
Input in;
class Output {
 private:
  ostream* out;
  template <typename T>
  inline void printSingle(const T& value) {
    *out << value;
  }
  template <typename T>
  void printSingle(const vector<T>& array) {
    size_t n = array.size();
    for (int i : range(n)) {
      *out << array[i];
      if (i + 1 != n) {
        *out << ' ';
      }
    }
  }
  template <typename T>
  void printSingle(const arr<T>& array) {
    int n = array.size();
    for (int i : range(n)) {
      *out << array[i];
      if (i + 1 != n) {
        *out << ' ';
      }
    }
  }
  template <typename T>
  void printSingle(const arr2d<T>& array) {
    size_t n = array.dim1();
    size_t m = array.dim2();
    for (int i : range(n)) {
      for (int j : range(m)) {
        *out << array(i, j);
        if (j + 1 != m) {
          *out << ' ';
        }
      }
      if (i + 1 != n) {
        *out << '\n';
      }
    }
  }
  template <typename T, typename U>
  inline void printSingle(const pair<T, U>& value) {
    *out << value.first << ' ' << value.second;
  }

 public:
  bool autoflush;
  Output(ostream& out, bool autoflush) : out(&out), autoflush(autoflush) {
    setPrecision(20);
  }
  void setOut(ostream& nOut) {
    out = &nOut;
    setPrecision(20);
  }
  inline void print() {}
  template <typename T, typename... Targs>
  inline void print(const T& first, const Targs... args) {
    printSingle(first);
    if (sizeof...(args) != 0) {
      *out << ' ';
      print(args...);
    }
    if (autoflush) {
      flush();
    }
  }
  template <typename... Targs>
  inline void printLine(const Targs... args) {
    print(args...);
    *out << '\n';
    if (autoflush) {
      flush();
    }
  }
  inline void flush() { out->flush(); }
  inline void setPrecision(int digs) { *out << fixed << setprecision(digs); }
};
Output out(cout, false);
Output err(cerr, true);
class ReverseNumberIterator : public NumberIterator {
 public:
  ReverseNumberIterator(int v) : NumberIterator(v) {}
  ReverseNumberIterator& operator++() {
    --v;
    return *this;
  }
};
class RevRange : pii {
 public:
  RevRange(int begin, int end) : pii(begin - 1, min(begin, end) - 1) {}
  RevRange(int n) : pii(n - 1, min(n, 0) - 1) {}
  ReverseNumberIterator begin() { return first; }
  ReverseNumberIterator end() { return second; }
};
class HRaznotsvetnieTroiki {
 public:
  void solve() {
    int n = in.readInt();
    auto a = in.readIntArray(n);
    int z = count((a).begin(), (a).end(), 0);
    int s = 0;
    int mid;
    for (int i : range(n)) {
      if (s == z / 2) {
        mid = i;
        break;
      }
      if (a[i] == 0) {
        s++;
      }
    }
    arr<int> first(n + 1, n);
    for (int i : RevRange(n, mid)) {
      first[a[i]] = i;
    }
    set<int> was;
    auto cmp = [&](int a, int b) -> bool { return first[a] < first[b]; };
    priority_queue<int, vi, decltype(cmp)> next(cmp);
    set<int> used;
    for (int i : RevRange(mid)) {
      if (a[i] == 0) {
        if (!next.empty()) {
          used.insert(next.top());
          next.pop();
        }
      } else if (was.count(a[i]) == 0) {
        was.insert(a[i]);
        next.push(a[i]);
      }
    }
    int nz = 0;
    for (int i : RevRange(n, mid)) {
      if (a[i] == 0) {
        nz++;
      } else if (used.count(a[i]) == 0 && nz > 0 && first[a[i]] == i) {
        used.insert(a[i]);
        nz--;
      }
    }
    out.printLine(min(z / 2, int(used.size())));
  }
};
int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(0);
  HRaznotsvetnieTroiki solver;
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) {
    solver.solve();
  }
  fflush(stdout);
  return 0;
}