#include <iostream>
#include <cmath>
int main() {
    int n;
    std::cin >> n;
    int smallest = pow(10, n - 1);
    int largest = pow(10, n) - 1;
    int count = 0;
    for (int i = smallest; i <= largest; i += 10) {
        if (i % 10 == 0) {
            count++;
        }
    }
    std::cout << smallest << std::endl;
    std::cout << largest << std::endl;
    std::cout << count << std::endl;

    return 0;
}

$\dcchuyentoan$

`@` C++

#include <iostream>
#include <cmath>
using namespace std;
int main() {
long long n;
cin>>n;
long long a=pow(10,n-1),b=a*10,d=(b-a)/10;
cout<<a<<"\n"<<b-1<<"\n"<<d<<"\n";
return 0;
}

`@`Python

import math
n=int(input())
a=int(math.pow(10,n-1))
b=a*10
d=(b-a)//10
print(a)
print(b-1)
print(d)

`@`Pascal

uses crt;
var n, a, b, d: Int64;
begin
clrscr;
readln(n);
a:=round(power(10,n-1));
b:=a*10;
d:=(b-a) div 10;
writeln(a);
writeln(b-1);
writeln(d);
readln;
end.