I. Bad Grades
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Michael received some very bad grades in his classes at Andover. He has taken $$$n$$$ classes. Each class gives Michael a grade in the range from $$$0$$$ to $$$100$$$. Michael doesn't want to fail any classes, so he hacked into the school's computer system to remove all class grades $$$ \lt 60$$$ from his transcript. Given a list of $$$n$$$ numbers, each number is in the range from $$$0$$$ to $$$100$$$, remove all elements $$$ \lt 60$$$ from Michael's list of grades.

Input

The first line contains a number $$$n$$$. $$$1\le n\le 10^5$$$. The next $$$n$$$ lines each contains one of Michael's grades. Each grade is in the range $$$[0, 100]$$$.

Output

Output the new list of grades. You should not change the ordering of Michael's grades.

Example
Input
5
100
90
59
65
40
Output
100
90
65