/*
Jessica Miller, CSE 142, Autumn 2010
This program calculates the most frequent digit found in an integer.
*/
import java.util.*;

public class FrequentDigits {
    public static void main(String[] args) {
        System.out.println(mostFrequentDigit(669260267));   // 6
        System.out.println(mostFrequentDigit(57135203));    // 3
        System.out.println(mostFrequentDigit(888444777));   // 4
        System.out.println(mostFrequentDigit(42));          // 2
        System.out.println(mostFrequentDigit(54321));       // 1
    }
	
	public static int mostFrequentDigit(int number) {
		int[] counts = new int[10];

		while (number > 0) {
			int nextDigit = number % 10;
			number = number / 10;
			counts[nextDigit]++;	
		}
		
		int mostFrequentIndex = 0;
		for (int i = 0; i < counts.length; i++) {
			if (counts[mostFrequentIndex] < counts[i]) {
				mostFrequentIndex = i;
			}
			
		}
		return mostFrequentIndex;
	}
}