Hiring process8 levels
  1. 1 IQ Test
  2. 2 Additional Online Test (If Required)
  3. 3 Office Interview with Hiring Manager
  4. 4 Unpaid Test Task (Motivation Check)
  5. 5 Paid Test Task and Follow-Up Interview
  6. 6 Iterative Paid Test Tasks
  7. 7 Office Verification
  8. 8 Final Interview with the Founder

Problems > The Hidden Face

The Hidden Face

Difficulty: 800 3000 ms 128 MB

math

On a standard die, opposite faces sum to 7. For each visible top face, print the hidden bottom face.

Input: the first line has N; the second line has the N top faces (1–6).

Output: N integers: the bottom faces.

Constraints:

  • 1 ≤ N ≤ 105

Sample Tests

Input 1
3
1 4 6
Output 1
6 3 1
Input 2
1
3
Output 2
4

Read the Editorial Statistics

Discussion (opens after you solve — no spoilers before)

No comments yet.

Submit Your Solution

Log in or create a free account to run and submit code.
Ctrl+Enter submit · Ctrl+Space autocomplete · F11 fullscreen