BestDivisor.java

import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.regex.*;


public class Solution 
{

    public static void main(String[] args) 
    {
        Scanner in = new Scanner(System.in);
        long s=0;long p=0;long t=0;
        long n = in.nextLong();
       
        for(long i=1;i<=n;i++){
           
            if(n%i==0){
               long z=i;
               while(z!=0){
                  long r=z%10;
                  s=s+r;
                  z=z/10;
               }
                if(s>t){
                    t=s;
                    p=i;
                }
                else if(s==t){
                    if(i<p)
                        p=i;
                }
                
                s=0;
            }
        }
        System.out.print(p);
        
    }
}