# Hack It!

## 题目描述

Little X has met the following problem recently.
Let’s define $f(x)$ as the sum of digits in decimal representation of number $x$ (for example, $f(1234)=1+2+3+4$). You are to calculate $\sum_{i=l}^r f(i) \bmod a$.
Of course Little X has solved this problem quickly, has locked it, and then has tried to hack others. He has seen the following C++ code:

ans = solve(l, r) % a;
if (ans <= 0) ans += a;


This code will fail only on the test with $\sum_{i=l}^r f(i) \equiv 0 \pmod a$. You are given number $a$, help Little X to find a proper test for hack.

## 代码

#include <cstdio>

long long mul(long long a, long long b, long long mod) {
long long ret = 0;
while (b) b & 1 && ((ret += a) %= mod), (a <<= 1) %= mod, b >>= 1;
return ret;
}

int main() {
long long n; scanf("%lld", &n);
long long cur = mul(1800000000000000000ll, 45, n) + 1, l = 1, r = 1000000000000000000ll;
l += n - cur, r += n - cur, printf("%lld %lld\n", l, r);
return 0;
}


418 I'm a teapot