#### Registered Users Only

Please login to utilize this feature.

Do note that this website only supports submissions in C++.

Problem Name: specialmagicsquare Problem Description: Weird squares are not magical enough, so today you need to construct a special magic square! A magic square is an arrangement of distinct numbers (i.e. each number is used once), usually integers, in a square grid, where the numbers in each row, and in each column, and the numbers in the main and secondary diagonals, all add up to the same number. For example, 2 3 4 5 6 7 8 9 10 is one such valid magic square. A magic square has the same number of rows as it has columns, and in conventional math notation, "n" stands for the number of rows (and columns) it has. A magic square of order n has n rows and n columns. A special magic square is somewhat similar. Any special magic square is also a magic square. However, the characteristic that makes it special is that when each number is converted to words, another magic square can be derived directly from the length of each word. Your task is to output one such special magic square with order 3. Input Format: There is no input. Output Format: 3 lines of 3 integers, representing the special magic square. It is guaranteed that such a case exists, where the largest element in the special magic square is <= 1,000,000.

### Tags

### Subtasks and Limits

Subtask | Score | #TC | Time | Memory | Scoring |
---|---|---|---|---|---|

1 | 100 | 1 | 10s | 32MB | Minimum |