public class Solution {
    public int colorful(int A) {
        Set<Integer> set = new HashSet<Integer>();
        int len = 0;
        int temp = A;
        while(temp != 0){
            temp = temp / 10;
            len++;
        }
        temp = A;
        int[] array = new int[len];
        for(int i = len-1; i>=0;i--){
            array[i] = temp % 10;
            temp = temp /10;
        }
        for(int i = 0; i<len;i++){
            if(set.contains(array[i])){
                return 0;
            }
            set.add(array[i]);
        }
        for(int i =0;i<len;i++){
            int num = array[i];
            for(int j = i+1;j<len;j++){
                num = num * array[j];
                if(set.contains(num)){
                    return 0;
                }
                set.add(num);
            }
        }
        return 1;
    }
}