#include #include "atcoder/all" #define debug cout << "OK" << endl; template inline bool chmax(T& a, const T b) { if (a < b) { a = b; return true; } return false; } template inline bool chmin(T& a, const T b) { if (a > b) { a = b; return true; } return false; } inline int Code(char c) { if ('A' <= c and c <= 'Z')return (int)(c - 'A'); if ('a' <= c and c <= 'z')return (int)(c - 'a'); if ('0' <= c and c <= '9')return (int)(c - '0'); assert(false); } using namespace std; using namespace atcoder; #define int long long constexpr int MOD = 998244353; constexpr int INF = (1LL << 63); using minit = modint998244353; template ostream& operator << (ostream& st, const vector& v) { for (const T value : v) { st << value << " "; } return st; } template istream& operator >> (istream& st, vector& v) { for (T& value : v) { st >> value; } return st; } // // class Solver { public: int T; Solver() :T(1) {} ~Solver(){} void multi(); void solve() const; void sp(int x)const; }; void Solver::multi() { cin >> T; return; } void Solver::sp(const int x)const { cout << fixed << setprecision(x) << endl; return; } void Solver::solve() const { int N; cin >> N; vector mp(9, 0); for (int i = 0; i < N; i++) { int a; cin >> a; mp[a]++; } int ans = 0; for (int i = 1; i < 9; i++) { for (int j = 1; j < 9; j++) { int t = 1; for (int k = 0; k < j; k++)t *= i; ans += mp[i] * mp[j] * t; } } cout << ans << endl; } signed main() { Solver solver; //solver.multi(); //solver.sp(); for (int i = 0; i < solver.T; i++) solver.solve(); return 0; } /* * わらびのコードこーどすぺーす (σ・∀・)σゲッツ!! */