B'Let 's call an array b_1, b_2, ldots, b_m ( m ge 2 ) good if it can be split into two parts such that all elements in the left part are strictly smaller than all elements in the right part. In other words, there must exist an index 1 <= i < m such that every element from b_1, ldots, b_i is strictly smaller than every element from b_{i+1}, ldots, b_m . Given an array a_1, a_2, ldots a_n consisting of distinct integers from 1 to n . There are q queries. Each query consists of two numbers l and r . For each query, determine whether the array a_l, a_{l+1}, ldots, a_r is good. The first line contains a single integer n ( 2 <= n <= 3 cdot 10^5 ) -- the size of the array. The second line contains n distinct integers a_1, a_2, ldots, a_n ( 1 <= a_n <= n ) -- the elements of the array a . The third line contains a single integer q ( 1 <= q <= 3 cdot 10^5 ) -- the number of queries. Each of the next q lines contains two integers l_i and r_i ( 1 <= l_i < r_i <= n ) -- the description of the i -th query. For each query, output "Yes" (without quotes) if the array a_l, a_{l+1}, ldots, a_r is good, and "No" (without quotes) otherwise. You can output "Yes" and "No" in any case (for example, the strings "yEs", "yes", "Yes", and "YES" will be recognized as a positive answer). In the first example: In the second example: '...