Count up in a somewhat complex way

What a silly pony...

1320

 Spoiler

Code:

public static int shidoCount(int ini) {
        int place = 1;
        int digit;
        boolean maxBase;
        int copy = ini;
        do {
            maxBase = true;
            digit = copy%10; // extract right-most digit
            if(digit < place) {
                maxBase = false;
            }
            else {
                copy = copy/10; // cut off the right-most digit
                ini -= digit*Math.pow(10, place-1);
                place++;        // keep track of the place of the 'current' right most digit
            }
            
        } while(maxBase && copy > 0);
        
        if(!maxBase) {
            ini += Math.pow(10, place-1);
        }
        else {
            ini = (int) Math.pow(10, place-1);
        }
        return ini;
    }

1321