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
//package com.company;

import java.util.*;
import java.lang.*;
import java.math.*;
import java.io.*;

public class Main {
    public static void main(String[] args) {
        InputStream inputStream;
        OutputStream outputStream;
        inputStream = System.in;
        outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Solver solver = new Solver();
        solver.Solve(in, out);
        out.close();
    }
}


class InputReader {
    public BufferedReader reader;
    public StringTokenizer tokenizer;

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

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

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

class Solver {
    //Constants
    static final int MaxN = 100100;
    static final int block = 317;
    static final int cBlocks = MaxN / block + 5;
    static final int C = 317;

    //DATA
    static int n, q, cntBlocks;
    static short[][] met = new short[cBlocks][MaxN];
    static int[][] vals = new int[cBlocks][block + C + 5], wasVals = new int[cBlocks][block + C + 5];
    static int[] szVals = new int[cBlocks], szWasVals = new int[cBlocks], a = new int[MaxN], b = new int[MaxN];


    static private void Build() {
        for (int i = 1; i <= n; i += block) {
            int r = Math.min(n, i + block - 1);
            for (int j = i; j <= r; j++) {
                vals[cntBlocks][szVals[cntBlocks]++] = a[j];
                //vals[cntBlocks].push_back(a[j]);
                wasVals[cntBlocks][szWasVals[cntBlocks]++] = a[j];
                //wasVals[cntBlocks].push_back(a[j]);
                met[cntBlocks][a[j]]++;
            }
            cntBlocks++;
        }
    }

    static private void reBuild() {
        int blen = 0;
        for (int i = 0; i < cntBlocks; i++) {
            for (int j = 0; j < szVals[i]; j++)
                b[++blen] = vals[i][j];
            szVals[i] = 0;
            //vals[i].resize(0);
            for (int j = 0; j < szWasVals[i]; j++)
                met[i][wasVals[i][j]] = 0;
            szWasVals[i] = 0;
            //wasVals[i].resize(0);
        }
        cntBlocks = 0;
        for (int i = 1; i <= n; i++)
            a[i] = b[i];
        Build();
    }

    static private int myErase(int idx) {
        int sum = 0;
        for (int i = 0; i < cntBlocks; i++) {
            sum += szVals[i];
            if (sum >= idx) {
                int pos = szVals[i] - (sum - idx) - 1;
                met[i][vals[i][pos]]--;
                int res = vals[i][pos];
                for (int it = pos; it < szVals[i]; it++)
                    vals[i][it] = vals[i][it + 1];
                szVals[i]--;
                return res;
            }
        }
        return 0;
    }

    static private void myInsert(int idx, int x) {
        int sum = 0;
        for (int i = 0; i < cntBlocks; i++) {
            sum += szVals[i];
            if (sum >= idx) {
                wasVals[i][szWasVals[i]++] = x;
                //wasVals[i].push_back(x);
                met[i][x]++;
                int pos = idx - (sum - szVals[i]);
                for (int it = szVals[i]; it > pos; it--)
                    vals[i][it] = vals[i][it - 1];
                vals[i][pos] = x;
                szVals[i]++;
                //vals[i].insert(vals[i].begin() + pos, x);
                break;
            }
        }
    }

    static private void doShiftQuery(int l, int r) {
        if (l == r) return;
        int x = myErase(r);
        myInsert(l - 1, x);
    }

    static private int doQueryCount(int r, int k) {
        int sum = 0, res = 0;
        for (int i = 0; i < cntBlocks; i++) {
            sum += szVals[i];
            if (sum <= r) {
                res += met[i][k];
            }
            else {
                sum -= szVals[i];
                int it = 0;
                while (sum < r) {
                    if (vals[i][it] == k) ++res;
                    ++sum; ++it;
                }
                break;
            }
        }
        return res;
    }

    static private int doQueryCount(int l, int r, int k) {
        return doQueryCount(r, k) - doQueryCount(l - 1, k);
    }

    static public void Solve(InputReader in, PrintWriter out) {
        n = in.nextInt();

        for (int i = 1; i <= n; i++)
            a[i] = in.nextInt();

        Build();

        q = in.nextInt();

        int z = 1;

        int last_ans = 0;
        for (int i = 1; i <= q; i++) {
            int comm, l, r, k;
            comm = in.nextInt();
            if (comm == 1) {
                l = in.nextInt();
                r = in.nextInt();
                l = ((l + last_ans - 1 + n) % n) + 1;
                r = ((r + last_ans - 1 + n) % n) + 1;
                if (l > r) {
                    int tmp = l;
                    l = r;
                    r = tmp;
                }
                doShiftQuery(l, r);
                z++;
            }
            else {
                l = in.nextInt();
                r = in.nextInt();
                k = in.nextInt();
                l = ((l + last_ans - 1 + n) % n) + 1;
                r = ((r + last_ans - 1 + n) % n) + 1;
                k = ((k + last_ans - 1 + n) % n) + 1;
                if (l > r) {
                    int tmp = l;
                    l = r;
                    r = tmp;
                }
                last_ans = doQueryCount(l, r, k);
                out.println(last_ans);
            }
            if (z % C == 0) {
                reBuild();
                z++;
            }
        }
    }
}