Problem H

Statement
Copy Copied
Description:
Sorting arrays is traditionally associated with high-level languages. How hard can it be in FALSE? Sort the given array in non-descending order.

Input Format:
The input consists of a single line of space-separated integers. The first number is n (1 ≤ n ≤ 10) — the size of the array. The following n numbers are the elements of the array (1 ≤ ai ≤ 100).

Output Format:
Output space-separated elements of the sorted array.

Note:
None

Evaluations

Eval IDRun IDProviderModelLangSuccessTimestampPromptResponseStdoutStderrRetry
176 20260205-113922 vertex gemini-3-pro-preview go true 2026-02-05T13:09:50.041505Z View View View View Retry