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.*;
import java.util.Arrays;
import java.util.LinkedList;
import java.util.StringTokenizer;


public class Main {


    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner(System.in);
        PrintWriter out = new PrintWriter(System.out);
        int n = sc.nextInt();
        int[] a = sc.nextIntArray(n);
        Block.a = a;
        int s = (int) (Math.sqrt(n) + 1);
        Block blocks[] = new Block[n];
        for (int i = 0; i < s && i * s < n; i++)
            blocks[i] = new Block(i * s, Math.min(n, (i + 1) * s) - 1);
        int m = sc.nextInt();
        int lastans = 0;
        while (m-- > 0) {
            int type = sc.nextInt();
            int ld = sc.nextInt();
            int rd = sc.nextInt();
            int l = ((ld + lastans - 1) % n);
            int r = ((rd + lastans - 1) % n);
            if (l > r) {
                int tmp = l;
                l = r;
                r = tmp;
            }
            int leftBlock = l / s;
            int rightBlock = r / s;
            if (type == 1) {
                int last = blocks[rightBlock].remove(r % s);
                blocks[leftBlock].insert(l % s, last);
                if (leftBlock != rightBlock) {
                    for (int b = leftBlock + 1; b <= rightBlock; b++) {
                        last = blocks[b - 1].removeLast();
                        blocks[b].addFirst(last);
                    }
                }
            } else {
                int kd = sc.nextInt();
                int k = ((kd + lastans - 1) % n) + 1;
                int ans = 0;
                if (leftBlock == rightBlock) {
                    ans += blocks[leftBlock].get(l, r, k);
                } else {
                    for (int b = leftBlock + 1; b <= rightBlock - 1; b++)
                        ans += blocks[b].get(k);
                    ans += blocks[leftBlock].get(l, blocks[leftBlock].r, k);
                    ans += blocks[rightBlock].get(blocks[rightBlock].l, r, k);

                }
                lastans = ans;
                out.println(ans);
            }
        }
        out.flush();
        out.close();
    }

    static class Block {
        static final int max = (int) (1e5 + 1);
        static int[] a;
        int[] cnt;
        int l, r;
        LinkedList<Integer> elements;

        public Block(int l, int r) {
            this.l = l;
            this.r = r;
            cnt = new int[max];
            elements = new LinkedList<>();
            for (int i = l; i <= r; i++) {
                elements.add(a[i]);
                cnt[a[i]]++;
            }
        }

        void addFirst(int x) {
            elements.addFirst(x);
            cnt[x]++;
        }

        int removeLast() {
            int x = elements.removeLast();
            cnt[x]--;
            return x;
        }

        int remove(int idx) {
            int x;
            x = elements.remove(idx);
            cnt[x]--;
            return x;
        }

        void insert(int idx, int x) {
            elements.add(idx, x);
            cnt[x]++;
        }

        int get(int x) {
            return cnt[x];
        }

        int get(int L, int R, int x) {
            int ans = 0;
            LinkedList<Integer> tmp = new LinkedList<>();
            for (int i = l; i <= r; i++) {
                int cur = elements.removeFirst();
                if (cur == x && i >= L && i <= R) ans++;
                tmp.addLast(cur);
            }
            elements = tmp;
            return ans;
        }

       
    }

    static class Scanner {
        StringTokenizer st;
        BufferedReader br;

        public Scanner(InputStream system) {
            br = new BufferedReader(new InputStreamReader(system));
        }

        public Scanner(String file) throws Exception {
            br = new BufferedReader(new FileReader(file));
        }


        public String next() throws IOException {
            while (st == null || !st.hasMoreTokens()) st = new StringTokenizer(br.readLine());
            return st.nextToken();
        }

        public String nextLine() throws IOException {
            return br.readLine();
        }

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

        public double nextDouble() throws IOException {
            return Double.parseDouble(next());
        }

        public char nextChar() throws IOException {
            return next().charAt(0);
        }

        public Long nextLong() throws IOException {
            return Long.parseLong(next());
        }

        public boolean ready() throws IOException {
            return br.ready();
        }


        public int[] nextIntArray(int n) throws IOException {
            int[] a = new int[n];
            for (int i = 0; i < n; i++)
                a[i] = nextInt();
            return a;
        }

        public long[] nextLongArray(int n) throws IOException {
            long[] a = new long[n];
            for (int i = 0; i < n; i++)
                a[i] = nextLong();
            return a;
        }


        public Integer[] nextIntegerArray(int n) throws IOException {
            Integer[] a = new Integer[n];
            for (int i = 0; i < n; i++)
                a[i] = nextInt();
            return a;
        }

        public double[] nextDoubleArray(int n) throws IOException {
            double[] ans = new double[n];
            for (int i = 0; i < n; i++)
                ans[i] = nextDouble();
            return ans;
        }

        public short nextShort() throws IOException {
            return Short.parseShort(next());
        }

    }
}