#include <bits/stdc++.h>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ld long double
#define ll long long
using namespace std;

#define MOD 1000000007
#define INF 100000000000000000

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int n;
    cin >> n;
    
    bool a[n];
    memset(a, false, sizeof(a));
    
    bool can = true;
    for (int i = 0; i < n; i++) {
        int x;
        cin >> x;
        x--;
        if (a[x]) can = false;
        a[x] = true;
    }
    
    for (int i = 0; i < n; i++) {
        if (!a[i]) can = false;
    }
    
    if (can) cout << "Yes\n";
    else cout << "No\n";
    
}

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define fw(p) for(int w=0;w<(p);w++)
#define fx(p) for(int x=0;x<(p);x++)
#define fy(p) for(int y=0;y<(p);y++)
#define fz(p) for(int z=0;z<(p);z++)
#define fyg(p,g) for(int y=(g);y<(p);y++)
#define fzg(p,g) for(int z=(g);z<(p);z++)
#define ce(d) cout<<d<<endl;
#define vecp(p) int aa;cin>>aa;(p).push_back(aa);
#define vecpl(p) long long aa;cin>>aa;(p).push_back(aa);
#define vecps(p) string aa;cin>>aa;(p).push_back(aa);
#define vecp2(p) cin>>aa;(p).push_back(aa);
#define vecpl2(p) long long a	b;cin>>ab;(p).push_back(ab);
#define vecps2(p) string ab;cin>>ab;(p).push_back(ab);
#define sorts(c) sort((c).begin(),(c).end());
#define reverses(c) reverse((c).begin(),(c).end());
#define vec(b) vector<int> (b);
#define vecl(b) vector<long long> (b);
#define vecs(b) vector<string> (b);
#define pb(b,a) (b).push_back((a));
#define doublece(a,b) cout<<(a)<<' '<<(b)<<endl;
#define pairs(s) vector<pair<int,int>> (s);
#define pairsp(s) int aa,bb;cin>>aa>>bb;(s).push_back(make_pair(aa,bb));
#define MOD 1000000007
#define cey ce("Yes")
#define cen ce("No")
#define ceY ce("YES")
#define ceN ce("NO")

int main()
{
int T;
	cin >> T;
	fx(T) {
		string S;
		cin >> S;
		bool a = true;
		fy(S.size()) {
			if (S[y] != 'a') { a = false; }
		}
		if (a) {
			ce(-1)
		}
		else if (S>"atcoder") {
			ce(0)
		}
		else {
			int ans = 0;
			while (S[ans] == 'a') { ans++; }
			if (ans>0&&S[ans] > 't') { ans--; }
			ce(ans)
		}

	}
    return 0;
}

