func_code_string: #include <bits/stdc++.h>   using namespace std;   const int mod = 998244353;   const int N = 200005;   int prime[1100000], primesize;   bool isprime[11000000];   long long f[N], invf[N];   long long inv[N];   void getlist(int listsize) {     memset(isprime, 1, sizeof(isprime));     isprime[1] = false;     for (int i = 2; i <= listsize; i++) {       if (isprime[i]) prime[++primesize] = i;       for (int j = 1; j <= primesize && i * prime[j] <= listsize; j++) {         isprime[i * prime[j]] = false;         if (i % prime[j] == 0) break;       }     }   }   void extend_gcd(long long a, long long b, long long& d, long long& x,                   long long& y) {     if (!b) {       d = a;       x = 1;       y = 0;     } else {       extend_gcd(b, a % b, d, y, x);       y -= x * (a / b);     }   }   void ni(int n) {     inv[0] = inv[1] = 1;     for (int i = 2; i <= n; i++) {       inv[i] = (mod - (mod / i)) * inv[mod % i] % mod;     }   }   long long fpow(long long a, long long k) {     long long res = 1;     while (k) {       if (k & 1) res = (res * a) % mod;       k >>= 1;       a = a * a % mod;     }     return res;   }   void init(int n) {     f[0] = 1;     for (int i = 1; i <= n; ++i) {       f[i] = f[i - 1] * i % mod;     }     invf[n] = fpow(f[n], mod - 2);     for (int i = n - 1; i >= 0; --i) {       invf[i] = invf[i + 1] * (i + 1) % mod;     }   }   long long C(int n, int k) {     if (k < 0 || k > n) return 0;     return f[n] * invf[k] % mod * invf[n - k] % mod;   }   long long pos[27][200005];   long long num[27];   void solve() {     long long n;     cin >> n;     string s;     cin >> s;     for (int i = 0; i < s.size(); i++) {       pos[s[i] -  a ][0]++;       pos[s[i] -  a ][pos[s[i] -  a ][0]] = i + 1;     }     long long m;     cin >> m;     for (int i = 1; i <= m; i++) {       memset(num, 0, sizeof(num));       string x;       cin >> x;       long long res = 0;       for (auto j : x) {         num[j -  a ]++;         res = max(res, pos[j -  a ][num[j -  a ]]);       }       cout << res << endl;     }   }   int main() {     ios::sync_with_stdio(false);     cin.tie(0);     int t = 1;     while (t--) {       solve();     }   }   