english-35 Stock Exchange

描述

Given the predictive stock prices P of N days. Find two days I and J to buy and sell the stock. I is less than J and (P[J] minus P[I]) should be maximum.

输入

First line: one positive integers N (N <= 100).Second line: N positive integers P[i] (P[i] <= 1000).

输出

Two integers I and J.

样例输入

1
25
3 5 4 6 2

样例输出

11 4

限制

• 时间限制：1000ms
• 内存限制：128MB