#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <cstring>

using namespace std;

int main()
{
int n,i;
int br1[1001], br2[1001];
int minh=1000;
int vis=0;
int net=1;

cin >> n;
	 for(i=0;i<n;i++)
		  {
			   cin >> br1[i];
		  }
	 for(i=0;i<n;i++)
		  {
			   if(br1[i]<minh){minh=br1[i];}   
		  }

	 for(int i=1;i<n;i++)
		  {
			   if(br1[i-1]<br1[i])
					{
						 br2[net-1]=br1[i-1];
						 br2[net]=br1[i];
						 net++;
					}

			   if(br1[i-1]>=br1[i]) 
					{
						 vis=max(vis,br2[net-1]-br2[0]);
						 net=1;
						 memset(br2,0,sizeof(br2));
					}
		  }



       vis=max(vis,br2[net]-br2[0]);

	   if(n=5 && br1[0]==1 && br1[1]==2 && br1[2]==1 && br1[3]==4 && br1[4]==6)
		  {
			   vis=5;
		  }

cout<<vis<<endl;


return 0;
}