// ********** CacheDemo.java **********
class Node {
  private int key;
  private Object obj;
  private Node next;
  public Node(int key, Object obj, Node next) {
    this.key = key;
    this.obj = obj;
    this.next = next;
  }
  public int getKey() { return key; }
  public Object getObject() { return obj; }
  public Node getNext() { return next; }
} 
class List {
  private Node head = null;
  public void enqueue(int key, Object obj) {
    head = new Node(key, obj, head); 
  }
  public Object find(int key) {
    Node current = head;
    while (current != null) {
      if (current.getKey() == key)
        return current.getObject();
      else
        current = current.getNext();
    }
    return null;
  }
}
class HashTable {
  public static final int HASH_SIZE = 100;
  private List array[] = new List[HASH_SIZE];
  public HashTable() {
    for (int i=0; i<HASH_SIZE; i++) 
      array[i] = new List();
  }
  public int hashFunction(int key) { return key % HASH_SIZE; }
  public void insert(int key, Object obj) {
    array[hashFunction(key)].enqueue(key,obj); 
  }
  public Object find(int key) {
    return array[hashFunction(key)].find(key);
  }
}
public class CacheDemo {
  public static void main(String args[]) {
    long t1 = System.currentTimeMillis();
    HashTable hash = new HashTable();
    for (int i=0; i<10*HashTable.HASH_SIZE*HashTable.HASH_SIZE; i++) 
      hash.insert(i,new Integer(i));
    for (int i=0; i<10*HashTable.HASH_SIZE*HashTable.HASH_SIZE; i++) {
      Integer j = (Integer)hash.find(i);
      //System.out.println(j.intValue()+ " ");
    }
    long t2 = System.currentTimeMillis();
    System.out.print((t2-t1)+" ");
    System.out.flush();
  }
}