#include <map>

 #include <cstdio>

 #include <cstring>

 #include <iostream>

 #include <algorithm>

 using namespace std;

 typedef long long LL;

 const LL maxn = ;

 const LL mod = ;

 LL a[maxn];

 map<LL, LL>M;

 int main ()

 {

     LL t, n;

     scanf ("%lld", &t);

     while (t --)

     {

         scanf ("%lld", &n);

         for (int i=; i<n; i++)

             scanf ("%lld", &a[i]);

         LL sum, cnt, num;

         sum = cnt = ;

         M.clear();

         for (int i=; i<n; i++)

         {

             num = (cnt +  - M[a[i]] + mod) % mod;

             sum = ( * sum % mod + num * a[i] % mod) % mod;

             M[a[i]] = (M[a[i]] + cnt + ) % mod;

             cnt = (cnt *  + ) % mod;

         }

         printf ("%lld\n", sum);

     }

     return ;

 }