Interval 2

Source: beecrowd

Version: Phuoc Hung OJ Extended

Problem Statement

Read n integers, count values inside inclusive [10,20] and outside; preserve IN/OUT output labels.

Input

n in [1,10000], followed by n integers in [-1000000,1000000] (PHOJ Extended).

Output

Two lines: <inside> in and <outside> out, lowercase.

Subtasks

• Subtask 1 (20%): $n\le5$, $|a_i|\le10$.
• Subtask 2 (30%): $n\le100$, $|a_i|\le100$.
• Subtask 3 (50%): $n\le10000$, $|a_i|\le10^6$.

Examples

Example 1

Input

5
10 20 9 21 15

Output

3 in
2 out

Explanation

10,20,15 are in; 9,21 are out.