Activation Code Generator

You are given an integer N and are required to generate N unique activation codes in lexicographical order. Each activation code consists of two uppercase letters followed by two digits. The total number of possible codes is given by \(26 \times 26 \times 100 = 67600\). The codes are generated in order: first letter (from 'A' to 'Z'), then second letter (from 'A' to 'Z'), and finally numbers from 00 to 99.

For example, if N = 5, the output should be:

AA00
AA01
AA02
AA03
AA04

inputFormat

The input consists of a single integer N (1 ≤ N ≤ 67600), which represents the number of activation codes to generate.

outputFormat

Output N activation codes, each on a new line, in lexicographical order.

5

AA00
AA01
AA02
AA03
AA04