#include<bits/stdc++.h>
using namespace std;
const int N = 105;
int d[N];
int ans = 0;
void solve()
{
if(d[0] > 2)d[0] = 2;
while(d[0] != 0)
{
int i;
for(i = 0; d[i] != 0; i ++)d[i] --;
ans += i;
}
return ;
}
int main()
{
int tt;
cin >> tt;
while(tt --)
{
int n;
cin >> n;
for(int i = 0; i < n; i ++)
{
int x;
cin >> x;
d[x] ++;
}
solve();
cout << ans << '\n';
memset(d, 0, sizeof(d));
ans = 0;
}
return 0;
}