public int find(int n) {
		boolean[] map = new boolean[10];
		while (n > 0) {
			map[n  % 10] = true;
			n /= 10;
		}
		int count = 0;
		for (boolean b : map) {
			if (b)
				count++;
		}
		return count;
	}