import java.util.Scanner;

public class Main {


	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);

		int n = scan.nextInt();

		int[] nAry = new int[n];

		for(int i = 0; i < n ; i++){
			nAry[i] = scan.nextInt();
		}

		int maxBenefit = Integer.MIN_VALUE;
		int min = nAry[0];
		int tmpBenefit;

		for(int i = 1; i < n ; i++){

			tmpBenefit = nAry[i] - min;

			if(maxBenefit < tmpBenefit){
				maxBenefit = tmpBenefit;
			}

			if(min > nAry[i]){
				min = nAry[i];
			}
		}

		System.out.println(maxBenefit);
	}

}
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz