class MyHashSet {
 private int size;
 private int capacity = 769;
 private Node[] data;
 /** Initialize your data structure here. */
 public MyHashSet() {
 data = new Node[capacity];
 }

 public void add(int key) {
 int index = hashIndex(key, capacity);
 Node current = data[index];
 if (current == null) {
 data[index] = new Node(key);
 size++;
 } else {
 while (current.getValue() != key && current.getNext() != null)
 current = current.next;
 if (current.getValue() != key) {
 current.setNext(new Node(key));
 size++;
 }
 }
 }

 public void remove(int key) {
 int index = hashIndex(key, capacity);
 Node current = data[index],
 prev = null;
 while (current != null) {
 if (current.getValue() == key) {
 if (null != prev)
 prev.setNext(current.getNext());
 else
 data[index] = current.getNext();
 size--;
 return;
 }
 prev = current;
 current = current.getNext();
 }
 }

 /** Returns true if this set contains the specified element */
 public boolean contains(int key) {
 int index = hashIndex(key,capacity);
 Node current = data[index];
 while (current != null) {
 if (current.getValue() == key)
 return true;
 current = current.getNext();
 }
 return false;
 }

 private int hashIndex(int key, int cap) {
 return key % (cap - 1);
 }

 class Node {
 private int value;
 private Node next;

 public Node(int value) {
 setValue(value);
 }

 public void setNext(Node next) {
 this.next = next;
 }

 public void setValue(int value) {
 this.value = value;
 }

 public Node getNext() {
 return next;
 }

 public int getValue() {
 return value;
 }
 }


}

/**
 * Your MyHashSet object will be instantiated and called as such:
 * MyHashSet obj = new MyHashSet();
 * obj.add(key);
 * obj.remove(key);
 * boolean param_3 = obj.contains(key);
 */