1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133

#include <cstdio>
#include <algorithm>
using namespace std;
const int size = 316;
const int maxn = 100005;
int getint() {
	int r = 0, k = 1; char c = getchar();
	for (; '0' > c || c > '9'; c = getchar()) if (c == '-') k = -1;
	for (; '0' <= c && c <= '9'; c = getchar()) r = r * 10 - '0' + c;
	return r * k;
}
int n, m, totBlock;
int data[640][2005], cnt[640][100005], nxtBlock[640], preBlock[640], siz[640], a[maxn];
void Build() {
	totBlock = (n + size - 1) / size;
	for (int i = 1; i <= totBlock; ++i) {
		int l = (i - 1) * size + 1, r = min(i * size, n);
		siz[i] = r - l + 1;
		for (int j = l; j <= r; ++j) {
			++cnt[i][a[j]];
			data[i][j - l + 1] = a[j];
		}
		nxtBlock[i] = i + 1;
		preBlock[i] = i - 1;
	}
	nxtBlock[totBlock] = 0;
}
int Query(int pos) {
	int tmp = 0;
	for (int i = 1; i; i = nxtBlock[i]) {
		tmp += siz[i];
		if (pos <= tmp)
			return data[i][pos - tmp + siz[i]];
	}
}
void Merge(int x, int y) {
	for (int i = 1; i <= siz[y]; ++i) {
		data[x][++siz[x]] = data[y][i];
		++cnt[x][data[y][i]];
	}
	nxtBlock[x] = nxtBlock[y];
}
void Split(int x) {
	++totBlock; int half = siz[x] / 2;
	for (int i = half + 1; i <= siz[x]; ++i) {
		data[totBlock][++siz[totBlock]] = data[x][i];
		--cnt[x][data[x][i]];
		++cnt[totBlock][data[x][i]];
	}
	siz[x] = half;
	preBlock[totBlock] = x;
	nxtBlock[totBlock] = nxtBlock[x];
	if (nxtBlock[x])
		preBlock[nxtBlock[x]] = totBlock;
	nxtBlock[x] = totBlock;
}
void Delete(int pos) {
	int tmp = 0;
	for (int i = 1; i; i = nxtBlock[i]) {
		tmp += siz[i];
		if (pos <= tmp) {
			tmp -= siz[i];
			--cnt[i][data[i][pos - tmp]];
			for (int j = pos - tmp; j <= siz[i]; ++j)
				data[i][j] = data[i][j + 1];
			--siz[i];
			if (siz[i] * 2 < size) {
				if (nxtBlock[i]) {
					Merge(i, nxtBlock[i]);
				} else if (preBlock[i]) {
					Merge(preBlock[i], i);
					i = preBlock[i];
				}
			}
			if (siz[i] > size * 2)
				Split(i);
			return;
		}
	}
}
void Insert(int pos, int val) {
	int tmp = 0;
	for (int i = 1; i; i = nxtBlock[i]) {
		tmp += siz[i];
		if (pos <= tmp) {
			tmp -= siz[i]; ++cnt[i][val];
			for (int j = siz[i]; j >= pos - tmp; --j)
				data[i][j + 1] = data[i][j];
			++siz[i]; data[i][pos - tmp] = val;
			if (siz[i] > size * 2)
				Split(i);
			return;
		}
	}
}
int Query(int pos, int k) {
	int tmp = 0, ret = 0;
	for (int i = 1; i; i = nxtBlock[i]) {
		tmp += siz[i];
		if (pos <= tmp) {
			pos -= tmp - siz[i];
			for (int j = 1; j <= pos; ++j)
				ret += (data[i][j] == k);
			return ret;
		}
		ret += cnt[i][k];
	}
	return ret;
}
int main() {
	freopen("array.in", "r", stdin);
	freopen("array.out", "w", stdout);
	int x, l, r, k;
	n = getint();
	for (int i = 1; i <= n; ++i)
		a[i] = getint();
	Build();
	m = getint();
	for (int i = 1; i <= m; ++i) {
		x = getint(); l = getint(); r = getint();
		if (x == 1) {
			int tmp = Query(r);
			Delete(r);
			Insert(l, tmp);
		} else {
			k = getint();
			printf("%d\n", Query(r, k) - Query(l - 1, k));
		}
	}
	fclose(stdin);
	fclose(stdout);
	return 0;
}