水平方向和竖直方向是等价的，只需要考虑奇偶性。奇数位置的代价是 $c_1, c_3, c_5, \ldots $，偶数位置的代价是 $c_2, c_4, c_6, \ldots$，假设一共走了 $k$ 步，在 $[1, k]$ 中找到奇数位置，对于代价 $c_j$，分配长度 $l_j$，使得 $\sum c_j \cdot l_j$ 最小，其中 $l_j \ge 1$，可以直观地想到，先找出 $c_j$ 的最小值 $c_{j_1}$，对于 $c_j \ne c_{j_1}, l_j = 1$，剩下的距离全部给 $c_{j_1}$。这可以 $O(1)$ 求出。对于 $k \in [2, n]$，求出奇数代价与偶数代价的和的最小值就是答案。

// Date: Wed Jan 10 19:09:33 2024

#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>

#include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> VI;
typedef pair<int, int> PII;
template <class T> using pq = priority_queue<T>;
template <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;

const int INF = 0x3f3f3f3f, MOD = 1e9 + 7, MOD1 = 998'244'353;
const ll INFL = 0x3f3f3f3f'3f3f3f3f;
const double eps = 1e-8;
const int dir[8][2] = {
    {0, 1}, {0, -1}, {1, 0}, {-1, 0}, {1, 1}, {1, -1}, {-1, 1}, {-1, -1},
};

const ull Pr = 131;

#define For(i, a, b) for (int i = int(a); i < int(b); ++i)
#define Rof(i, a, b) for (int i = int(b) - 1; i >= int(a); --i)
#define For1(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define Rof1(i, a, b) for (int i = int(b); i >= int(a); --i)
#define ForE(i, j) for (int i = h[j]; i != -1; i = ne[i])

#define f1 first
#define f2 second
#define pb push_back
#define has(a, x) (a.find(x) != a.end())
#define nemp(a) (!a.empty())
#define all(a) (a).begin(), (a).end()
#define SZ(a) int((a).size())
#define NL cout << '\n';

template <class T> bool ckmin(T &a, const T &b) { return b < a ? a = b, 1 : 0; }
template <class T> bool ckmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; }

template <typename t> istream &operator>>(istream &in, vector<t> &vec) {
  for (t &x : vec)
    in >> x;
  return in;
}

template <typename t> ostream &operator<<(ostream &out, vector<t> &vec) {
  int n = SZ(vec);
  For(i, 0, n) {
    out << vec[i];
    if (i < n - 1)
      out << ' ';
  }
  return out;
}

void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }

template <typename T, typename V> void __print(const pair<T, V> &x) {
  cerr << '{';
  __print(x.first);
  cerr << ", ";
  __print(x.second);
  cerr << '}';
}
template <typename T> void __print(const T &x) {
  int f = 0;
  cerr << '{';
  for (auto &i : x)
    cerr << (f++ ? ", " : ""), __print(i);
  cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V> void _print(T t, V... v) {
  __print(t);
  if (sizeof...(v))
    cerr << ", ";
  _print(v...);
}

#ifdef _DEBUG
#define debug1(x) cout << #x " = " << x << endl;
#define debug2(x, y) cout << #x " = " << x << " " #y " = " << y << endl;
#define debug3(x, y, z)                                                        \
  cout << #x " = " << x << " " #y " = " << y << " " #z " = " << z << endl;
#define dbg(x...)                                                              \
  cerr << "\e[91m" << __func__ << ":" << __LINE__ << " [" << #x << "] = [";    \
  _print(x);                                                                   \
  cerr << "\e[39m" << endl;
#else
#define debug1
#define debug2
#define debug3
#define dbg(x...)
#endif

const int N = 100100;
int n;
ll a[N];

void solve() {
  cin >> n;

  For1(i, 1, n) { cin >> a[i]; }
  ll odd_mi = a[1], eve_mi = a[2], odd_sum = a[1], eve_sum{};
  int odd_cnt = 1, eve_cnt = 0;
  map<ll, int> odd_s, eve_s;
  odd_s[odd_mi]++;
  ll ans = INFL;

  For1(i, 2, n) {
    if (i & 1) {
      ckmin(odd_mi, a[i]);
      odd_s[a[i]]++;
      odd_cnt++;
      odd_sum += a[i];
    } else {
      ckmin(eve_mi, a[i]);
      eve_cnt++;
      eve_s[a[i]]++;
      eve_sum += a[i];
    }

    int odd_other = odd_cnt - odd_s[odd_mi],
        eve_other = eve_cnt - eve_s[eve_mi];
    ll odd_cost = (odd_sum - odd_s[odd_mi] * odd_mi) + (n - odd_other) * odd_mi,
       eve_cost = (eve_sum - eve_s[eve_mi] * eve_mi) + (n - eve_other) * eve_mi,
       tmp = odd_cost + eve_cost;

    ckmin(ans, tmp);
  }

  cout << ans << '\n';
}

int main(void) {
#ifdef _DEBUG
  freopen("1499c.in", "r", stdin);
#endif
  std::ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);

  int T = 1;
  cin >> T;

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

  return 0;
}