public class NumberList  
{	
   protected int[] list;				// list of values being stored
   protected int number, max;			// current size of list, maximum size of list

   public NumberList()					// no arg constructor, assume max of 100
   {
		list=new int[100];
		max=100;
		number=0;
   }
   
   public NumberList(int size) 			// Constructor uses parameter to establish maximum size
   {
		list=new int[size];
		max=size;
		number=0;
   }
   
   public void add(int x) 				// insert x at the end of the array at location number
   {
		if(number<max) 
		{
	   		list[number]=x;
	   		number++;
		}
   }
   
   public int get(int x)				// return element at location x if x is within bounds, else -99999
   {		
 		if(x>=0&&x<number)
			return list[x];
		else return -99999;
   }

   public int find(int x) 				// find index of element x, -1 if not found
   {
      	for(int i=0;i<number;i++)
	   		if(list[i]==x) return i;
      	return -1;
   }

   public void delete(int x) 			// delete element at index x, shifting remaining elements down (toward 0)
   {
      	if(x>=0&&x<number)
      	{
	   		for(int i=x+1;i<number;i++)
	      		list[i-1]=list[i];
  	   		number--;
      	}
   }
}