// Return the first index i with A[i] = key, or -1 if absent.

import java.util.*;

public class LinearSearch {
  public static int LinearSearch(int[] A, int key) {
    int i = 0;
    while ((i < A.length)) {
      if ((A[i] == key)) {
        return i;
      }
      i = (i + 1);
    }
    return (-1);
  }

  public static void main(String[] args) {
    int[] A = new int[] {5, 2, 4, 6, 1, 3, 8, 7};
    int key = 0;
    int result = LinearSearch(A, key);
    System.out.println(result);
  }
}