boolean includeNum(int n, int m)
    {
        while(m > 0)
        {
            if(n%10 == m%10)
            {
                n = n/10;
                m= m/10;
            }
            else
                return false;
        }
        return true;
    }
    int checkNumDigitsSum(int n)
    {
        int sum = 0;
        while(n > 0 )
        {
            sum = sum+ n%10;
            n=n/10;
        }
        return sum;
    }
     int MaxNumber(int n)
     {
         int saveNum = n;
         int counter = 0;

         while(saveNum > 0)
            {
                saveNum= saveNum/10;
                counter++;
            }
        int checkNumber = n;
        int ret = 0;
        boolean t;

        while(checkNumber%n != 0 && ret!= n && t != true )
        {
            ret=checkNumDigitsSum(checkNumber);
            t = includeNum(checkNumber,n);
            checkNumber = checkNumber+Math.pow(10,counter);
        }

        return checkNumber;

     }