Write a program that reads a sequence of natural numbers and checks that all those in odd positions form a descending sequence.
Input
Each number in the input sequence is a non-negative integer. Numbers are separated by blank spaces or line ends, or both; at least one such separator, but maybe more than one. Their positions in the sequence are considered as starting with position zero.
Output
The numbers in even positions can be arbitrary; if the numbers in odd positions form a descending sequence, according to the standard inequality comparison on integers, your program must write the message: "Odd-Position Numbers Descending." Otherwise, your program must write the message: "Odd-Position Numbers Not Descending."
Input
261 10 226 9 278 8 206 7 221 6 260 5 227 4 271 3 225 2 230
Output
Odd-Position Numbers Descending.
Input
260 3 227 5 271 3 225
Output
Odd-Position Numbers Not Descending.
Input
3 6 3 4 3 3 3 1
Output
Odd-Position Numbers Descending.
Input
3 3 3 3 3 3
Output
Odd-Position Numbers Not Descending.