Array Selection I

Source: beecrowd

Version: Phuoc Hung OJ Extended

Problem Statement

You are given a real-valued array $A$ containing exactly $100$ elements indexed from $0$ through $99$. Traverse the array in increasing index order and select every element satisfying

Only selected elements are printed. Each printed value must have exactly one digit after the decimal point.

Input

The input contains exactly $100$ real numbers. Each value may be positive, negative, or zero.

Output

For each index $i$ satisfying $A_i\le10$, print A[i] = x, where $x$ has exactly one digit after the decimal point. Lines must be printed in increasing index order. If no element satisfies the condition, print nothing.

Subtasks

Subtask 1 (100 points): $-10^6\le A_i\le10^6$. This is the Phuoc Hung OJ data bound; the original selection rule and output format are unchanged.

Examples

Input

0.0
-5.0
22.0
-8.5
24.0
25.0
26.0
27.0
28.0
29.0
10.0
31.0
32.0
33.0
34.0
35.0
36.0
37.0
38.0
39.0
40.0
41.0
42.0
43.0
44.0
45.0
46.0
47.0
48.0
49.0
50.0
51.0
52.0
53.0
54.0
55.0
56.0
57.0
58.0
59.0
60.0
61.0
62.0
63.0
64.0
65.0
66.0
67.0
68.0
69.0
70.0
71.0
72.0
73.0
74.0
75.0
76.0
77.0
78.0
79.0
80.0
81.0
82.0
83.0
84.0
85.0
86.0
87.0
88.0
89.0
90.0
91.0
92.0
93.0
94.0
95.0
96.0
97.0
98.0
99.0
100.0
101.0
102.0
103.0
104.0
105.0
106.0
107.0
108.0
109.0
110.0
111.0
112.0
113.0
114.0
115.0
116.0
117.0
118.0
9.9

Output

A[0] = 0.0
A[1] = -5.0
A[3] = -8.5
A[10] = 10.0
A[99] = 9.9

Explanation

In the sample, indices $0,1,3,10,99$ contain $0.0,-5.0,-8.5,10.0,9.9$, all at most $10$. Every other value is greater than $10$ and is skipped. Therefore exactly those five lines are printed in increasing index order.