C++

Given a sequence of integers, check to see if the sequence constitutes a heap

Input: the first line is an integer n(0 < n < 10000), The second line is n integers

Output: If the sequence is a very small heap, that is, the top of the heap is the smallest element, then output "min heap". If the sequence is a very large heap, the top of the heap is the largest element

The output includes one line with a newline at the end

Example:

## Input

5

3 4 2 1 1

##Output:

no