Given a sequence of integers. Find in it the maximum number that is not a multiple of 3. There is at least one number in the sequence that is not a multiple of 3
Input data: In the first line enter the number N - the number of numbers in the sequence, and then N integers, one per line.
Output: Output the answer to the problem
Examples
# |
Input |
Output |
1 |
7
4
6
8
-3
-4
3
-2 |
8 |