#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(int)(n); i++)

using namespace std;
using LL = long long;

int N;
vector<LL> A, B;
LL sum, max_A;

void solve(){
	LL dif=max_A-(N-2);
	if(dif<=0){
		cout << 0 << endl;
		return;
	}
	while(1){
		LL res=0;
		rep(i,N) B[i]=(N-2)-(A[i]-dif);
		rep(i,N) res+=B[i]/(N-1);
		if(res>=dif){
			cout << dif << endl;
			return;
		}
		dif++;
	}
}

int main(){
	cin >> N;
	A.resize(N), B.resize(N);
	rep(i,N) cin >> A[i];
	rep(i,N) sum+=A[i], max_A=max(max_A,A[i]);
	int Q;
	cin >> Q;
	rep(i,Q){
		int q;
		cin >> q;
		if(q==1){
			LL t, x;
			cin >> t >> x;
			max_A=max(max_A,x);
			t--;
			sum+=x-A[t];
			A[t]=x;
		}
		else{
			solve();
		}
	}

	return 0;
}