1809A - Garland - CodeForces Solution

#include<bits/stdc++.h>
#pragma GCC optimize("O3")
#define ll long long
#define se second
#define fi first
#define pb push_back
#define pf push_front
using namespace std;
long double rad = 57.295779513, pi = 3.1415926535;
int mod = 1000000007;
const int N = 4e5 + 17;
ll n , i , j;
string s;
void solve(){
   //UwU
   cin >> s;
   sort(s.begin() , s.end());
   if(s[0] == s[3]){
     cout << -1;
     return ;
   }
   int p = 0;
   for(i = 1;i < 4; ++ i){
    if(s[i] != s[i - 1]) p ++;
   }
   if(p + 1 == 2 and (s[0] != s[1] or s[2] != s[3])) cout << 6;
   else cout << 4;
}
main()
{
   //cout << v.size();
    ios_base::sync_with_stdio(0);
    cin.tie(0),cout.tie(0);
    ll T = 1;
    cin >> T;
    while(T --)
    {
        solve();
        cout << '\n';
    }
}
//anro
//musoxon
//#NOWAR
//atso city and yes this is city
//