import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static string[] s_rd;
T RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
string RDR()() { return readln.chomp; }
T[] ARR(T = long)(in string str, T fix = 0) { auto r = str.split.to!(T[]); r[] += fix; return r; }
size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
long lcm(long x, long y) { return x * y / gcd(x, y); }

long mod = 10^^9 + 7;
//long mod = 998244353;
//long mod = 1_000_003;
void moda(ref long x, long y) { x = (x + y) % mod; }
void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(ref long x, long y) { x = (x * y) % mod; }

size_t binarySearch(alias pred, T)(in T[] arr, bool isLower = true)
{ 
	long ok, ng;
	if (isLower) { ok = arr.length; ng = -1; }
	else		 { ok = 0; ng = arr.length; }
	while (abs(ok-ng) > 1)
	{
		size_t mid = cast(size_t)(ok+ng) / 2;
		if (unaryFun!pred(arr[mid]))
			ok = mid;
		else ng = mid;
	}
	return cast(size_t)ok;
}

void main()
{
	auto n = RD!int;
	auto s = RD!string;
	auto cnt = new int[][](s.length+1, 26);
	foreach (i; 0..s.length)
	{
		auto c = cnt[i].dup;
		++c[s[i]-'a'];
		cnt[i+1] = c;
	}
	auto m = RD!int;
	foreach (i; 0..m)
	{
		auto t = RD!string;
		auto cnt2 = new int[](26);
		foreach (c; t)
		{
			++cnt2[c-'a'];
		}
		bool check(in int[] cnt1)
		{
			foreach (j; 0..cnt1.length)
			{
				if (cnt1[j] < cnt2[j])
					return false;
			}
			return true;
		}
		auto pos = binarySearch!(check)(cnt);
		writeln(pos);
	}

	stdout.flush();
	debug readln();
}