The Smart Beaver has recently designed and built an innovative nanotechnologic all-purpose beaver mass shaving machine, "Beavershave 5000". Beavershave 5000 can shave beavers by families! How does it work? Very easily!

There are n beavers, each of them has a unique id from 1 to n. Consider a permutation a1, a2, ..., an of n these beavers. Beavershave 5000 needs one session to shave beavers with ids from x to y (inclusive) if and only if there are such indices i1 < i2 < ... < ik, that ai1 = x, ai2 = x + 1, ..., aik - 1 = y - 1, aik = y. And that is really convenient. For example, it needs one session to shave a permutation of beavers 1, 2, 3, ..., n.

If we can't shave beavers from x to y in one session, then we can split these beavers into groups [x, p1], [p1 + 1, p2], ..., [pm + 1, y] (x ≤ p1 < p2 < ... < pm < y), in such a way that the machine can shave beavers in each group in one session. But then Beavershave 5000 needs m + 1 working sessions to shave beavers from x to y.

All beavers are restless and they keep trying to swap. So if we consider the problem more formally, we can consider queries of two types: 

  * what is the minimum number of sessions that Beavershave 5000 needs to shave beavers with ids from x to y, inclusive? 
  * two beavers on positions x and y (the beavers ax and ay) swapped. 



You can assume that any beaver can be shaved any number of times.

Input

The first line contains integer n — the total number of beavers, 2 ≤ n. The second line contains n space-separated integers — the initial beaver permutation.

The third line contains integer q — the number of queries, 1 ≤ q ≤ 105. The next q lines contain the queries. Each query i looks as pi xi yi, where pi is the query type (1 is to shave beavers from xi to yi, inclusive, 2 is to swap beavers on positions xi and yi). All queries meet the condition: 1 ≤ xi < yi ≤ n.

  * to get 30 points, you need to solve the problem with constraints: n ≤ 100 (subproblem B1); 
  * to get 100 points, you need to solve the problem with constraints: n ≤ 3·105 (subproblems B1+B2). 



Note that the number of queries q is limited 1 ≤ q ≤ 105 in both subproblem B1 and subproblem B2.

Output

For each query with pi = 1, print the minimum number of Beavershave 5000 sessions.

Examples

Input

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


Output

2
1
3
5
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.InputMismatchException;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.Writer;
import java.util.StringTokenizer;
import java.util.HashSet;
import java.io.InputStream;

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

class TaskB2 {

    final int shift = 1 << 19;
    int[] q = new int[shift << 1];

    int rsum(int l, int r) {
        if(l > r)
            return 0;
        if(l % 2 != 0)
            return rsum(l + 1, r) + q[l];
        if(r % 2 == 0)
            return rsum(l, r - 1) + q[r];
        return rsum(l / 2, r / 2);
    }

    int sum(int l, int r) {
        return rsum(l + shift, r + shift);
    }

    void set(int v, int value) {
        //System.err.println("set " + v + " " + value);
        v += shift;
        if(q[v] == value)
            return;
        q[v] = value;
        v /= 2;
        while (v > 0) {
            q[v] = q[2 * v] + q[2 * v + 1];
            v /= 2;
        }
    }

    public void solve(int testNumber, Reader in, OutputWriter out) {
        int n = in.nextInt();
        int[] permutation = in.nextIntArray(n);
        int[] where = new int[n];



        for(int i = 0; i < n; ++i) {
            --permutation[i];
            where[permutation[i]] = i;
        }

        for(int i = 0; i + 1< n; ++i) {
            if(where[i] > where[i + 1])
                set(i, 1);
        }

        int q = in.nextInt();
        for(int query = 0; query < q; ++query) {
            int type = in.nextInt();
            if(type == 1) {
                out.println(1 + sum(in.nextInt() - 1, in.nextInt() - 2));
            }
            else {
                int a = in.nextInt() - 1;
                int b = in.nextInt() - 1;

                HashSet<Integer> interesting = new HashSet<Integer>();
                for(int i = -1; i <= 0; ++i) {
                    interesting.add(permutation[a] + i);
                    interesting.add(permutation[b] + i);
                }

                int tmp = permutation[a];
                permutation[a] = permutation[b];
                permutation[b] = tmp;

                where[permutation[a]] = a;
                where[permutation[b]] = b;
                for (int i: interesting) {
                    if(i < 0 || i + 1 >= n)
                        continue;
                    int newValue = where[i] > where[i + 1] ? 1 : 0;
                    set(i, newValue);
                }



            }
        }



    }
}

class Reader {
    private BufferedReader reader;
    private StringTokenizer tokenizer;

    public Reader(BufferedReader reader) {
        this.reader = reader;
    }

    public Reader(InputStream stream) {
        this(new BufferedReader(new InputStreamReader(stream)));
    }

    public String nextString() {
        while (tokenizer == null || !tokenizer.hasMoreTokens()) {
            tokenizer = new StringTokenizer(readLine());
        }
        return tokenizer.nextToken();
    }

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

    public int[] nextIntArray(int size) {
        int[] array = new int[size];
        for (int i = 0; i < size; ++i) {
            array[i] = nextInt();
        }
        return array;
    }

    private String readLine() {
        try {
            return reader.readLine();
        } catch (IOException e) {
            throw new RuntimeException(e);
        }
    }
}

class OutputWriter extends PrintWriter {

	public OutputWriter(OutputStream out) {
		super(out);
	}

	public OutputWriter(java.io.Writer writer){
		super(writer);
	}

	}
