You are given a sequence A[1], A[2], ..., A[N] ( 0 ≤ A[i] ≤ 10^8 , 2 ≤ N ≤ 10^5 ). There are two types of operations and they are defined as follows:

Update:

This will be indicated in the input by a 'U' followed by space and then two integers i and x.

U i x, 1 ≤ i ≤ N, and x, 0 ≤ x ≤ 10^8.

This operation sets the value of A[i] to x.

Query:

This will be indicated in the input by a 'Q' followed by a single space and then two integers i and j.

Q x y, 1 ≤ x < y ≤ N.

You must find i and j such that x ≤ i, j ≤ y and i != j, such that the sum A[i]+A[j] is maximized. Print the sum A[i]+A[j].

Input

The first line of input consists of an integer N representing the length of the sequence. Next line consists of N space separated integers A[i]. Next line contains an integer Q, Q ≤ 10^5, representing the number of operations. Next Q lines contain the operations.

Output

Output the maximum sum mentioned above, in a separate line, for each Query.

Example

Input:
5
1 2 3 4 5
6
Q 2 4
Q 2 5
U 1 6
Q 1 5
U 1 7
Q 1 5

Output:
7
9
11
12

---

hide comments

< Previous 1 2 3 4 5 6 7 8 9 10 11 Next >
	vijay kumar paliwal: 2016-05-27 11:36:30 @Rajat Singh Size of seg tree can go upto 4N for an array of size N.
	man: 2016-05-21 05:21:45 first easy one related to segment tree encountred..
	nk17kumar: 2016-04-21 20:57:10 yeaah ! 1st attempt AC :)
	Safayet Islam Anonno: 2016-02-06 07:30:50 So easy, AC in 0th submission. YAAAAY
	anshal dwivedi: 2015-12-25 09:30:52 Easy one ! Ac in on go.......... :)
	sunil: 2015-12-25 08:05:59 ac in first go
	gulshan_raj: 2015-12-04 07:32:09 HeHe.. a single typo caused me more than 15 WA. awesome feeling :-)
	Prateek Agarwal: 2015-11-30 11:19:00 My first Segment Tree :)
	Rajat Singh: 2015-09-25 19:50:45 what is this??? how can N>10^5??
	Rajat Singh: 2015-09-25 19:50:44 what is this??? how can N>10^5??