/**
*Adam Khazi, Array Program.
*/
public class arrayprog
{
public static void main(String[] args)
{
new arrayprog();
}

public arrayprog()
{
	int[] freqarray  = new int [100];
	int i = 0;
	int Num = 10;
	int Num1 = 1;
	int mused = 1;
	int musedcounter = 1;
	int lused = 1;
	int greatest = 1;
	int lowest = 10;
	
	
 	while (Num != 0) {  
 	i = i + 1;
 	Num = IBIO.inputInt("Enter Number: ");
 	if (Num > greatest) {
 		greatest = Num;
 	}

 	if (Num < lowest && Num != 0) {
 		lowest = Num;
 	}
 	//if (numbers[index] > lowest) {
 		//lowest = numbers[index];
 		//}
	freqarray[Num] = freqarray[Num]+1 ;
 	}
 	Num = 2;
 	for(int a=1; a<11; a++) {
 	if (freqarray[greatest] > freqarray[Num]) {
 		mused  = freqarray[Num];
 		Num = Num +1;
 		greatest = greatest +1;
 	}
 	}
 						
	
	//while (Num  == 0) {
		//System.exit(0); 
		//IBIO.output ("ZOMG I End");
		//}	
 	
 	int s = 1; //visual output 
 	int total = i;
 	total = total - 1;
 	Num = 1;
 	
	for(int a=1; a<11; a++) {
	IBIO.output  (s + ": " + freqarray[Num] );
	Num = Num + 1;
	s = s+1;
	
	
	
	
		}
	IBIO.output("Total number of values entered was: "+ total);
	IBIO.output("The greatest number inputted was " + greatest);
	IBIO.output("The lowest number inputted was " + lowest);
	IBIO.output("The number inputted the most was " + mused);
 	} 	
}