import Data.List

main = do
    line<-getLine
    line<-getLine
    let a = [read x::Int|x<-words line]
    let aL = [x+y|(x,y)<-zip a [1..]]
    let aR = sort [y-x|(x,y)<-zip a [1..]]
    print 1

lower_bound :: [Int]->Int->Int
lower_bound a t = _lower_bound a 0 (length a) t

_lower_bound :: [Int]->Int->Int->Int->Int
_lower_bound a first 0  _= first
_lower_bound a first len target = do
    let half = div len 2
    let middle = first + half
    if a!!middle < target 
        then _lower_bound a (middle+1) (len-half-1) target 
        else _lower_bound a first half target

upper_bound :: [Int]->Int->Int
upper_bound a t = _upper_bound a 0 (length a) t

_upper_bound :: [Int]->Int->Int->Int->Int
_upper_bound a first 0 _ = first
_upper_bound a first len target = do
    let half = div len 2
    let middle = first + half 
    if a!!middle > target
        then _upper_bound a first half target
        else _upper_bound a (middle+1) (len-half-1) target

