#!/usr/bin/python

import random 
A = random.sample(range(1,99999999), 1000)

def search (a, A):

    def linsearch (a, A, i, l):
        # INV: 0<=i<= l = len(A) /\ forall j: 0<=j<i: a =/= A[j] 
        while (i<l) and  (a != A[i]):
            i=i+1
        return i
    # end linsearch
    
    l = len(A)
    i = linsearch (a, A, 0, l)
    if (i>=l):
        print 'not found'
    else:
        print 'found at index', i
# end search

a = random.sample(range(1,99999999), 1)[0]
print a
search (a, A)
b = random.sample(range(0,999), 1)[0]
print b
a = A[b]
search (a, A)