import sequtils,algorithm,math,tables
import sets,intsets,queues,heapqueue,bitops,strutils
template times*(n:int,body) = (for _ in 0..<n: body)
template `max=`*(x,y) = x = max(x,y)
template `min=`*(x,y) = x = min(x,y)

proc getchar_unlocked():char {. importc:"getchar_unlocked",header: "<stdio.h>" .}
proc scan(): int =
  while true:
    let k = getchar_unlocked()
    if k < '0': break
    result = 10 * result + k.ord - '0'.ord

# type
#   CPriorityQueue {.importcpp: "std::priority_queue", header: "<queue>".} [T] = object
# proc cNewPriorityQueue(T: typedesc): CPriorityQueue[T]
#   {.importcpp: "std::priority_queue<'*1>()", nodecl.}
# proc newPriorityQueue*[T](): CPriorityQueue[T] = cNewPriorityQueue(T)
# proc size*[T](this: CPriorityQueue[T]):int {.importcpp: "#.size(@)", nodecl.}
# proc push*[T](this: CPriorityQueue[T],x:T) {.importcpp: "#.push(@)", nodecl.}
# proc top*[T](this: CPriorityQueue[T]): T  {.importcpp: "#.top()", nodecl.}
# proc pop*[T](this: CPriorityQueue[T]){.importcpp: "#.pop()", nodecl.}

proc solve() : int =
  let n = scan()
  let L = newSeqWith(n,scan()).sorted(cmp)
  var R = @[1]
  for i in 1..<n:
    if L[i-1] == L[i] : R[^1] += 1
    else: R &= 1
  if R.len < 3: return
  var q = newHeapQueue[int]()
  for r in R: q.push(-r)
  while true:
    let a = -q.pop() - 1
    let b = -q.pop() - 1
    let c = -q.pop() - 1
    if a < 0 or b < 0 or c < 0 : return
    result += 1
    q.push(-a)
    q.push(-b)
    q.push(-c)


scan().times:echo solve()