//#define NDEBUG

#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <utility>
#include <vector>

namespace n91 {

using i32 = std::int32_t;
using i64 = std::int64_t;
using u32 = std::uint32_t;
using u64 = std::uint64_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;

struct rep {
  struct itr {
    usize i;
    constexpr itr(const usize i) noexcept : i(i) {}
    void operator++() noexcept { ++i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  const itr f, l;
  constexpr rep(const usize f, const usize l) noexcept
      : f(std::min(f, l)), l(l) {}
  constexpr auto begin() const noexcept { return f; }
  constexpr auto end() const noexcept { return l; }
};
struct revrep {
  struct itr {
    usize i;
    constexpr itr(const usize i) noexcept : i(i) {}
    void operator++() noexcept { --i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  const itr f, l;
  constexpr revrep(const usize f, const usize l) noexcept
      : f(l - 1), l(std::min(f, l) - 1) {}
  constexpr auto begin() const noexcept { return f; }
  constexpr auto end() const noexcept { return l; }
};
template <class T> auto md_vec(const usize n, const T &value) {
  return std::vector<T>(n, value);
}
template <class... Args> auto md_vec(const usize n, Args... args) {
  return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));
}
template <class T> constexpr T difference(const T &a, const T &b) noexcept {
  return a < b ? b - a : a - b;
}
template <class T> void chmin(T &a, const T &b) noexcept {
  if (b < a)
    a = b;
}
template <class T> void chmax(T &a, const T &b) noexcept {
  if (a < b)
    a = b;
}
template <class F> class rec_lambda {
  F f;

public:
  rec_lambda(F &&f) : f(std::move(f)) {}
  template <class... Args> auto operator()(Args &&... args) const {
    return f(*this, std::forward<Args>(args)...);
  }
};
template <class F> auto make_rec(F &&f) { return rec_lambda<F>(std::move(f)); }
template <class T> T scan() {
  T ret;
  std::cin >> ret;
  return ret;
}
constexpr char eoln = '\n';
template <class T> T ceildiv(const T &l, const T &r) {
  return l / r + (l % r != 0 ? 1 : 0);
}

} // namespace n91

#include <set>

namespace n91 {

void solve() {
  const usize n = scan<usize>();
  std::vector<u32> a(n);
  for (auto &e : a) {
    std::cin >> e;
  }
  bool f_win = true;
  if (n % 2 == 0) {
    std::sort(a.begin(), a.end());
    f_win = false;
    for (const usize i : rep(0, n / 2)) {
      if (a[2 * i] != a[2 * i + 1]) {
        f_win = true;
      }
    }
  } else {
    f_win = false;
  }
  std::cout << (f_win ? "First" : "Second") << eoln;
}

void main_() {
  /*
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  //*/
  const usize t = scan<usize>();
  for (const usize i : rep(0, t)) {
    solve();
  }
}

} // namespace n91

int main() {
  n91::main_();
  return 0;
}

#include <bits/stdc++.h>

using namespace std;

int n, a[300005];
int bit[300005];

void update(int x) {
    for (int i = x; i <= n; i += (i & (-i))) {
        bit[i]++;
    }
}

int query(int x) {
    int tot = 0;
    for (int i = x; i >= 1; i -= (i & (-i))) {
        tot += bit[i];
    }
    return tot;
}

int main() {
    scanf("%d", &n);

    long long inv = 0;

    for (int i = 0; i < n; i++) {
        scanf("%d", &a[i]);
        a[i]++;

        inv += a[i] - 1 - query(a[i]);
        update(a[i]);

    }

    printf("%lld\n", inv);
    for (int i = 0; i < n - 1; i++) {
        inv -= a[i] - 1;
        inv += n - a[i];
        printf("%lld\n", inv);
    }
}