#!/usr/bin/env python

#inp = '10,8,6,4,2,1,3,5,7,9'.split(',')
inp = '985 978 969 957 951 946 928 925 906 895 881 878 860 859 843 833 826 822 809 802 783 769 757 753 749 745 742 725 720 710 693 688 674 673 654 643 629 626 618 609 600 593 577 560 556 554 537 523 518 505 501 494 487 483 477 466 452 447 445 435 423 412 408 399 390 386 368 362 357 349 342 327 325 319 305 300 298 284 267 253 240 236 229 211 206 200 199 183 177 162 149 145 137 122 116 104 87 74 62 60 54 37 31 29 18 10 1 20 36 55 58 69 75 77 96 105 106 125 142 147 159 160 178 196 197 198 205 212 226 233 235 238 245 255 274 282 296 311 322 324 326 337 348 350 363 373 375 376 392 405 418 433 434 453 461 469 474 492 508 521 533 539 540 553 569 580 599 601 606 612 621 624 627 638 657 667 678 692 704 711 716 723 729 743 756 759 773 791 795 812 815 817 820 832 836 846 853 857 861 862'.split(' ')
find = '200'
counter = 0

def Query(n):
  global counter
  counter += 1
  return inp[n]

# Find pivot
l = 0
h = len(inp) - 1
while True:
  m = (h + l) / 2
  if (m >= h):
    break
  if (Query(m) > Query(m + 1)):
    l = m + 1
  else:
    h = m

p = m
print "Pivot is", Query(p), "at", p

l = 0
h = p
f = False
t = -1
while True:
  m = (h + l) / 2
  t = Query(m)
  #print l, m, h, t
  if (find < t):
    l = m + 1
  elif (find > t):
    h = m - 1
  else:
    f = True
    break
  if (l > h):
    break

if (not f):
  l = p
  h = len(inp) - 1
  t = -1
  while True:
    m = (h + l) / 2
    t = Query(m)
    #print l, m, h, t
    if (find > t):
      l = m + 1
    elif (find < t):
      h = m - 1
    else:
      f = True
      break
    if (l > h):
      break

if (f):
  print "Found it at " + str(m) + "!"
else:
  print "Did not find it!"
print str(counter) + " queries done"