// Incomplete LinkedIntList class
public class LinkedIntList {
	private ListNode front;
	
	public LinkedIntList() {
		front = null;
	}

	public int get(int index) {
		ListNode current = front;
		for (int i = 0; i < index; i++) {
			current = current.next;
		}
		return current.data;
	}

	public void add(int value) {
		if (front == null) {
			front = new ListNode(value);
		} else {
			ListNode current = front;
		
			// find the last node of the list
			while (current.next != null) {
				current = current.next;
			}
		
			current.next = new ListNode(value);
		}
	}
}