int solve()
{
	int n;
	scanf("%d", &n);
	vi p(n), delta(n), r(n);
	for (int i = 0; i < n; ++i)
		p[i] = i;
	function<int(int)> get = [&](int u)
	{
		if (p[u] == u)
			return u;
		return get(p[u]);
	};
	function<int(int)> geth = [&](int u)
	{
		if (p[u] == u)
			return delta[u];
		return delta[u] + geth(p[u]);
	};
	auto unit = [&](int x, int y)
	{
		int cur = geth(x) + 1;
		x = get(x);
		y = get(y);
		if (x == y)
			return;
		if (r[x] < r[y])
		{
			delta[x] += cur;
			swap(x, y);
			cur = 0;
		}
		p[y] = x;
		delta[y] += cur - delta[x];
		if (r[x] == r[y])
			++r[x];
	};
	vector<vi> up(16, vi(n, -1));
	for (int i = 0; i < n; ++i)
	{
		int x;
		scanf("%d", &x);
		if (x == 0)
		{
			continue;
		}
		--x;
		unit(x, i);
		up[0][i] = x;
	}
	function<int(int, int)> getup = [&](int l, int u)
	{
		if (l == -1)
			return -1;
		if (u == -1)
			return -1;
		if (geth(u) < (1 << l))
			return -1;
		if (up[l][u] != -1)
			return up[l][u];
		return up[l][u] = getup(l - 1, getup(l - 1, u));
	};
	auto getlca = [&](int x, int y)
	{
		int hx = geth(x);
		int hy = geth(y);
		if (hx < hy)
			swap(x, y), swap(hx, hy);
		int dst = hx - hy;
		for (int i = 15; i >= 0; --i)
		{
			if ((dst >> i) & 1)
				x = getup(i, x);
		}
		if (x == y)
			return x;
		for (int i = 15; i >= 0; --i)
		{
			int nx = getup(i, x);
			int ny = getup(i, y);
			if (nx != ny)
				x = nx, y = ny;
		}
		return getup(0, x);
	};
	int q;
	scanf("%d", &q);
	int lst = 0;
	while (q--)
	{
		int cmd;
		scanf("%d", &cmd);
		if (cmd)
		{
			int x, y;
			scanf("%d %d", &x, &y);
			--x, --y;
			x += lst;
			y += lst;
			x %= n;
			y %= n;
			unit(y, x);
			up[0][x] = y;
		}
		else
		{
			int x, y;
			scanf("%d %d", &x, &y);
			--x, --y;
			x += lst;
			y += lst;
			x %= n;
			y %= n;
			if (get(x) != get(y))
			{
				puts("0");
				lst = 0;
				continue;
			}
			lst = getlca(x, y) + 1;
			printf("%d\n", lst);
		}
	}
	return 0;
}