Problem:
MathJax.Hub.Config({ tex2jax: { inlineMath: [["$","$"], ["\\(","\\)"]], processEscapes: true }});

Maximum Profit

You can obtain profits from foreign exchange margin transactions. For example, if you buy 1000 dollar at a rate of 100 yen per dollar, and sell them at a rate of 108 yen per dollar, you can obtain (108 - 100) × 1000 = 8000 yen.

Write a program which reads values of a currency $R_t$ at a certain time $t$ ($t = 0, 1, 2, ... n-1$), and reports the maximum value of $R_j - R_i$ where $j > i$ .

Input

The first line contains an integer $n$. In the following $n$ lines, $R_t$ ($t = 0, 1, 2, ... n-1$) are given in order.

Output

Print the maximum value in a line.

Constraints

$2 \leq n \leq 200,000$

$1 \leq R_t \leq 10^9$

Sample Input 1

6
5
3
1
3
4
3

Sample Output 1

3

Sample Input 2

3
4
3
2

Sample Output 2

-1

Solution in C# (judge verdict: Wrong Answer)

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace ConsoleApplication5
{
    class Program
    {
        static void Main(string[] args)
        {
            int i;
            int [] l=new int[10000];
            string [] s= new string[10000];
           string j=Console.ReadLine();
            int k=int.Parse(j);
            for(i=1;i==k;i++){
                        s[i]=Console.ReadLine();
                 l[i]=int.Parse(s[i]);

            }
            int max=l[1];
            int min=l[1];
            for (i = 1; i == k; i++)
            {
                if (l[i]>max)
                {
                    max = l[i];
                }
                if (l[i] <min)
                {
                    min = l[i];
                }
            }
            Console.WriteLine("{0}", max - min);
        }
    }
}