Enumerate bicolor numbers Z98456
Exactly as in the exercise "Bicolor Numbers", we define a bicolor number as a natural number n with only two different digits that are repeated in two blocks (or "colors").
Write a program that prints all bicolor numbers with N digits.
Input
The input consists of a natural number N, with N ≥ 2.
Output
A list of bicolor numbers with N digits, one per line. The numbers can be written in any order. You can generate the output as you wish, either using integers or generating the numbers character by character.
Public test cases
Input
3
Output
100 110 122 112 133 113 144 114 155 115 166 116 177 117 188 118 199 119 200 220 211 221 233 223 244 224 255 225 266 226 277 227 288 228 299 229 300 330 311 331 322 332 344 334 355 335 366 336 377 337 388 338 399 339 400 440 411 441 422 442 433 443 455 445 466 446 477 447 488 448 499 449 500 550 511 551 522 552 533 553 544 554 566 556 577 557 588 558 599 559 600 660 611 661 622 662 633 663 644 664 655 665 677 667 688 668 699 669 700 770 711 771 722 772 733 773 744 774 755 775 766 776 788 778 799 779 800 880 811 881 822 882 833 883 844 884 855 885 866 886 877 887 899 889 900 990 911 991 922 992 933 993 944 994 955 995 966 996 977 997 988 998