1 class Solution {
 2     public int largestPalindrome(int n) {
 3         if(n == 1) return 9;
 4         int upper = (int)Math.pow(10,n)-1;
 5         for(int i = upper; i>upper/10; i--){
 6             long palin = toPalindrome(i);
 7             for(int j = upper; j>upper/10; j--){
 8                 if(palin / j > upper)
 9                     break;
10                 if(palin % j == 0)
11                     return (int)(palin % 1337);
12             }
13         }
14         return -1;
15     }
16 
17     public long toPalindrome(int i){
18         StringBuffer str = new StringBuffer();
19         str.append(i+"");
20         String a = str.reverse().toString();
21         return Long.parseLong(i+""+a);
22     }
23 }