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 codeforces;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;

public class D {
    BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
    PrintWriter writer = new PrintWriter(System.out);
    StringTokenizer stringTokenizer;

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

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

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

    @SuppressWarnings("unchecked")
    void solve() throws IOException {
        final int BLOCK_SIZE = 300;
        int n = nextInt();
        final int qblock = (n - 1) / BLOCK_SIZE + 1;
        class LinkedList implements Iterable<Integer> {
            int size = 512;
            int[] a = new int[size];
            int l = 0, r = 0;

            void add(int x) {
                a[r++] = x;
                r &= size - 1;
            }
            void addLast(int x) {
                add(x);
            }
            int remove(int i) {
                i += l;
                i &= size - 1;
                int removed = a[i];
                for(int j = i + 1 & size - 1; j != r; j = j + 1 & size - 1) {
                    a[j - 1 & size - 1] = a[j];
                }
                r = r - 1 & size - 1;
                return removed;
            }
            int pollFirst() {
                int x = a[l++];
                l &= size - 1;
                return x;
            }
            void add(int i, int x) {
                i = i + l & size - 1;
                for(int j = r; j != i; j = j - 1 & size - 1) {
                    a[j] = a[j - 1 & size - 1];
                }
                r = r + 1 & size - 1;
                a[i] = x;
            }
            int pollLast() {
                r = r - 1 & size - 1;
                return a[r];
            }
            void addFirst(int x) {
                l = l - 1 & size - 1;
                a[l] = x;
            }

            @Override
            public Iterator<Integer> iterator() {
                return new Iterator<Integer>() {
                    int i = l;

                    @Override
                    public boolean hasNext() {
                        return i != r;
                    }

                    @Override
                    public Integer next() {
                        int x = a[i];
                        i = i + 1 & size - 1;
                        return x;
                    }

                    @Override
                    public void remove() {

                    }
                };
            }
        }
        final LinkedList[] blocks = new LinkedList[qblock];
        for (int i = 0; i < blocks.length; i++) {
            blocks[i] = new LinkedList();
        }
        final short[][] ftable = new short[qblock][100 * 1000 + 1];
        for (int i = 0; i < n; i++) {
            final int e = nextInt();
            final int block = i / BLOCK_SIZE;
            blocks[block].add(e);
            ftable[block][e]++;
        }
        class Utils {
            int delete(int index) {
                int blockIndex = index / BLOCK_SIZE;
                int removed = blocks[blockIndex].remove(index % BLOCK_SIZE);
                ftable[blockIndex][removed]--;
                for (int block = blockIndex + 1; block < blocks.length; block++) {
                    final int e = blocks[block].pollFirst();
                    blocks[block - 1].addLast(e);
                    ftable[block][e]--;
                    ftable[block - 1][e]++;
                }
                return removed;
            }

            void add(int what, int where) {
                int blockIndex = where / BLOCK_SIZE;
                blocks[blockIndex].add(where % BLOCK_SIZE, what);
                ftable[blockIndex][what]++;
                for (int block = blockIndex; block + 1 < blocks.length; block++) {
                    final int e = blocks[block].pollLast();
                    blocks[block + 1].addFirst(e);
                    ftable[block][e]--;
                    ftable[block + 1][e]++;
                }
            }

            void shift(int l, int r) {
                add(delete(r), l);
            }

            int query(int l, int r, int k) {
                int result = 0;
                for (int block = 0; block < blocks.length; block++) {
                    int first = block * BLOCK_SIZE;
                    int last = (block + 1) * BLOCK_SIZE - 1;
                    if (first > r || last < l) continue;
                    if (first >= l && last <= r) {
                        result += ftable[block][k];
                        continue;
                    }
                    int index = first;
                    for (Integer o : blocks[block]) {
                        if (index >= l && index <= r && o == k) {
                            result++;
                        }
                        index++;
                    }
                }
                return result;
            }
        }
        int lastAns = 0;
        int q = nextInt();
        Utils utils = new Utils();
        for (int i = 0; i < q; i++) {
            int t = nextInt();
            int l = (nextInt() + lastAns - 1) % n;
            int r = (nextInt() + lastAns - 1) % n;
            if(l > r) {
                int tmp = l;
                l = r;
                r = tmp;
            }
            if (t == 1) {
                utils.shift(l, r);
            }
            if (t == 2) {
                int k = (nextInt() + lastAns - 1) % n + 1;
                lastAns = utils.query(l, r, k);
                writer.println(lastAns);
            }
        }
        writer.close();
    }

    public static void main(String[] args) throws IOException {
        new D().solve();
    }
}
