public class Euler725 {
    static final long kMod = 10000000000000000L;

    public static String solve() {
        int n = 2020;
        long answer = 0;

        for (int s = 0; s <= 9; ++s) {
            int target = 2 * s;

            long[][] cnt = new long[19][2];
            long[][] sumVal = new long[19][2];

            for (int d = 1; d <= 9; ++d) {
                if (d > target)
                    break;
                int has = (d == s) ? 1 : 0;
                cnt[d][has] = (cnt[d][has] + 1) % kMod;
                sumVal[d][has] = (sumVal[d][has] + d) % kMod;
            }

            for (int len = 1; len <= n; ++len) {
                if (target < 19) {
                    answer = (answer + sumVal[target][1]) % kMod;
                }
                if (len == n)
                    break;

                long[][] nextCnt = new long[19][2];
                long[][] nextSum = new long[19][2];

                for (int currentSum = 0; currentSum <= target; ++currentSum) {
                    for (int has = 0; has <= 1; ++has) {
                        long c = cnt[currentSum][has];
                        if (c == 0)
                            continue;
                        long sv = sumVal[currentSum][has];

                        for (int d = 0; d <= 9; ++d) {
                            int ns = currentSum + d;
                            if (ns > target)
                                break;
                            int nh = (has != 0 || d == s) ? 1 : 0;

                            nextCnt[ns][nh] = (nextCnt[ns][nh] + c) % kMod;
                            long appended = (sv * 10 % kMod + c * d % kMod) % kMod;
                            nextSum[ns][nh] = (nextSum[ns][nh] + appended) % kMod;
                        }
                    }
                }

                cnt = nextCnt;
                sumVal = nextSum;
            }
        }

        return Long.toString(answer);
    }

    public static void main(String[] args) {
        System.out.println(solve());
    }
}