public class Euler168 {
    public static void main(String[] args) {
        int MOD = 100000;
        long total = 0;
        for (int digits = 2; digits <= 100; digits++)
            for (int m = 1; m <= 9; m++)
                for (int last = 1; last <= 9; last++) {
                    long val = last % MOD;
                    int cur = last, carry = 0, place = 10 % MOD;
                    for (int pos = 1; pos < digits; pos++) {
                        int nxt = m * cur + carry;
                        carry = nxt / 10;
                        cur = nxt % 10;
                        val = (val + (long) cur * place) % MOD;
                        place = (int) ((long) place * 10 % MOD);
                    }
                    int leading = m * cur + carry;
                    if (cur == 0 || leading != last)
                        continue;
                    total = (total + val) % MOD;
                }
        System.out.println(total);
    }
}