"We've tried solitary confinement, waterboarding and listening to Just In Beaver, to no avail. We need something extreme."

"Little Alena got an array as a birthday present..."

The array b of length n is obtained from the array a of length n and two integers l and r (l ≤ r) using the following procedure:

b₁ = b₂ = b₃ = b₄ = 0.

For all 5 ≤ i ≤ n:

b_i = 0 if a_i, a_i - 1, a_i - 2, a_i - 3, a_i - 4 > r and b_i - 1 = b_i - 2 = b_i - 3 = b_i - 4 = 1
b_i = 1 if a_i, a_i - 1, a_i - 2, a_i - 3, a_i - 4 < l and b_i - 1 = b_i - 2 = b_i - 3 = b_i - 4 = 0
b_i = b_i - 1 otherwise

You are given arrays a and b' of the same length. Find two integers l and r (l ≤ r), such that applying the algorithm described above will yield an array b equal to b'.

It's guaranteed that the answer exists.

Input

The first line of input contains a single integer n (5 ≤ n ≤ 10⁵) — the length of a and b'.

The second line of input contains n space separated integers a₁, ..., a_n ( - 10⁹ ≤ a_i ≤ 10⁹) — the elements of a.

The third line of input contains a string of n characters, consisting of 0 and 1 — the elements of b'. Note that they are not separated by spaces.

Output

Output two integers l and r ( - 10⁹ ≤ l ≤ r ≤ 10⁹), conforming to the requirements described above.

If there are multiple solutions, output any of them.

It's guaranteed that the answer exists.

Note

In the first test case any pair of l and r pair is valid, if 6 ≤ l ≤ r ≤ 10⁹, in that case b₅ = 1, because a₁, ..., a₅ < l.

Idx	Name	Rating
A	Points on the line	1200
B	Our Tanya is Crying Out Loud	1400
C	Phone Numbers	1500
D	Alena And The Heater	1600
E	Cashback	2000
F	Machine Learning	2600

Codeforces Round 466 (Div. 2)