Serega loves fun. However, everyone has fun in the unique manner. Serega has fun by solving query problems. One day Fedor came up with such a problem.

You are given an array a consisting of n positive integers and queries to it. The queries can be of two types:

  1. Make a unit cyclic shift to the right on the segment from l to r (both borders inclusive). That is rearrange elements of the array in the following manner:a[l], a[l + 1], ..., a[r - 1], a[r] → a[r], a[l], a[l + 1], ..., a[r - 1].
  2. Count how many numbers equal to k are on the segment from l to r (both borders inclusive). 



Fedor hurried to see Serega enjoy the problem and Serega solved it really quickly. Let's see, can you solve it?

Input

The first line contains integer n (1 ≤ n ≤ 105) — the number of elements of the array. The second line contains n integers a[1], a[2], ..., a[n] (1 ≤ a[i] ≤ n).

The third line contains a single integer q (1 ≤ q ≤ 105) — the number of queries. The next q lines contain the queries.

As you need to respond to the queries online, the queries will be encoded. A query of the first type will be given in format: 1 l'i r'i. A query of the second type will be given in format: 2 l'i r'i k'i. All the number in input are integer. They satisfy the constraints: 1 ≤ l'i, r'i, k'i ≤ n.

To decode the queries from the data given in input, you need to perform the following transformations:

li = ((l'i + lastans - 1) mod n) + 1; ri = ((r'i + lastans - 1) mod n) + 1; ki = ((k'i + lastans - 1) mod n) + 1.

Where lastans is the last reply to the query of the 2-nd type (initially, lastans = 0). If after transformation li is greater than ri, you must swap these values.

Output

For each query of the 2-nd type print the answer on a single line.

Examples

Input

7
6 6 2 7 4 2 5
7
1 3 6
2 2 4 2
2 2 4 7
2 2 2 5
1 2 6
1 1 4
2 1 7 3


Output

2
1
0
0


Input

8
8 4 2 2 7 7 8 8
8
1 8 8
2 8 1 7
1 8 1
1 7 3
2 8 8 3
1 1 4
1 2 7
1 4 5


Output

2
0
import java.io.InputStreamReader;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
	public static void main(String[] args) {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskD solver = new TaskD();
		solver.solve(1, in, out);
		out.close();
	}
}

class TaskD {
    private final static int MAGIC = 2048;

    public void solve(int testNumber, InputReader in, PrintWriter out) {
        int n = in.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; ++i)
            a[i] = in.nextInt() - 1;
        int numBlock = (n + MAGIC - 1) / MAGIC;
        int[][] count = new int[n][numBlock];
        for (int i = 0; i < n; ++i)
            ++count[a[i]][i / MAGIC];
        DynamicIntegerArray[] blocks = new DynamicIntegerArray[numBlock];
        for (int bl = 0; bl < numBlock; ++bl) {
            DynamicIntegerArray block = new DynamicIntegerArray(MAGIC);
            for (int i = bl * MAGIC; i < (bl + 1) * MAGIC && i < n; ++i)
                block.addLast(a[i]);
            blocks[bl] = block;
        }
        int lastAnswer = 0;
        int q = in.nextInt();
        for (int qq = 0; qq < q; ++qq) {
            int type = in.nextInt();
            int l = (in.nextInt() - 1 + lastAnswer) % n;
            int r = (in.nextInt() - 1 + lastAnswer) % n;
            if (l > r) {
                int t = l;
                l = r;
                r = t;
            }
            int firstBlock = l / MAGIC;
            int lastBlock = r / MAGIC;
            int le = l % MAGIC;
            int ri = r % MAGIC;
            if (type == 1) {
                if (firstBlock == lastBlock) {
                    DynamicIntegerArray block = blocks[firstBlock];
                    int save = block.get(ri);
                    for (int i = ri; i > le; --i)
                        block.set(i, block.get(i - 1));
                    block.set(le, save);
                } else {
                    DynamicIntegerArray block = blocks[lastBlock];
                    int save = block.get(ri);
                    --count[save][lastBlock];
                    for (int i = ri; i > 0; --i)
                        block.set(i, block.get(i - 1));
                    block.pollFirst();
                    for (int bl = lastBlock - 1; bl > firstBlock; --bl) {
                        int value = blocks[bl].pollLast();
                        ++count[value][bl + 1];
                        --count[value][bl];
                        blocks[bl + 1].addFirst(value);
                    }
                    block = blocks[firstBlock];
                    int value = block.peekLast();
                    ++count[value][firstBlock + 1];
                    --count[value][firstBlock];
                    blocks[firstBlock + 1].addFirst(value);
                    for (int i = MAGIC - 1; i > le; --i)
                        block.set(i, block.get(i - 1));
                    block.set(le, save);
                    ++count[save][firstBlock];
                }
            } else {
                int k = (in.nextInt() - 1 + lastAnswer) % n;
                int answer = 0;
                if (firstBlock == lastBlock) {
                    DynamicIntegerArray block = blocks[firstBlock];
                    for (int i = le; i <= ri; ++i)
                        if (block.get(i) == k)
                            ++answer;
                } else {
                    DynamicIntegerArray block = blocks[firstBlock];
                    for (int i = le; i < MAGIC; ++i)
                        if (block.get(i) == k)
                            ++answer;
                    block = blocks[lastBlock];
                    for (int i = 0; i <= ri; ++i)
                        if (block.get(i) == k)
                            ++answer;
                    int[] cnt = count[k];
                    for (int bl = firstBlock + 1; bl < lastBlock; ++bl)
                        answer += cnt[bl];
                }
                out.println(answer);
                lastAnswer = answer;
            }
        }
    }
}

class DynamicIntegerArray {
    private int[] data;
    private int offset;
    private int size;

    DynamicIntegerArray(int capacity) {
        offset = size = 0;
        ensureCapacity(capacity);
    }

    public int get(int index) {
        if (index < 0 || index >= size)
            throw new IndexOutOfBoundsException(String.valueOf(index));
        return data[offset + index];
    }

    public void set(int index, int value) {
        if (index < 0 || index >= size)
            throw new IndexOutOfBoundsException(String.valueOf(index));
        data[offset + index] = value;
    }

    int peekLast() {
        return get(size - 1);
    }

    int peekFirst() {
        return get(0);
    }

    public int pollFirst() {
        int res = peekFirst();
        ++offset;
        --size;
        return res;
    }

    public int pollLast() {
        int res = peekLast();
        --size;
        return res;
    }

    public void addFirst(int value) {
        ensureCapacity(size + 1);
        data[--offset] = value;
        ++size;
    }

    public void addLast(int value) {
        ensureCapacity(size + 1);
        data[offset + size] = value;
        ++size;
    }

    private void ensureCapacity(int capacity) {
        if (capacity < size)
            capacity = size;
        if (offset == 0 || offset + capacity >= data.length) {
            int[] newData = new int[3 * capacity];
            if (data != null)
                System.arraycopy(data, offset, newData, capacity, size);
            data = newData;
            offset = capacity;
        }
    }
}

class InputReader {
    private BufferedReader reader;
    private StringTokenizer tokenizer;

    public InputReader(InputStream stream) {
        reader = new BufferedReader(new InputStreamReader(stream), 32768);
        tokenizer = null;
    }

    public String next() {
        try {
            while(tokenizer == null || !tokenizer.hasMoreTokens())
                tokenizer = new StringTokenizer(reader.readLine());
        } catch (IOException e) {
            throw new RuntimeException(e);
        }
        return tokenizer.nextToken();
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }

}

