[Codetree] Carry 피하기 2

import java.util.Scanner;
public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] arr = new int[n];
        for (int i = 0; i < n; i++) {
            arr[i] = sc.nextInt();
        }
        // Please write your code here.

        int max = -1;
        for(int i = 0; i < arr.length; i++) {
            for(int j = i+1; j < arr.length; j++) {
                for(int k = j+1; k < arr.length; k++) {
                    if(isNotCarry(arr[i],arr[j],arr[k])) {
                        max = Math.max(max,arr[i]+arr[j]+arr[k]);
                    }
                }
            }
        }
        System.out.println(max);
    }

    public static boolean isNotCarry(int a, int b, int c){
        while(true) {
            if(a == 0 && b == 0 && c == 0) break;            
            if(a%10+b%10+c%10 >= 10) return false;
            a /= 10;
            b /= 10;
            c /= 10;
        }
        return true;
    }
}