import java.util.Scanner;

public class Main {

	static boolean[] prime;

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

		int n = sc.nextInt();
		int[] R = new int[n];
		for (int i=0; i<n; i++) {
			R[i] = sc.nextInt();
		}

		int ans = -2000000000;
		int min = R[0];
		for (int i=1; i<n; i++) {
			ans = Math.max(ans, R[i]-min);
			min = Math.min(min, R[i]);
		}

		System.out.println(ans);

		sc.close();
	}

} import java.util.Scanner; Scanner java.util public class Main {

	static boolean[] prime;

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

		int n = sc.nextInt();
		int[] R = new int[n];
		for (int i=0; i<n; i++) {
			R[i] = sc.nextInt();
		}

		int ans = -2000000000;
		int min = R[0];
		for (int i=1; i<n; i++) {
			ans = Math.max(ans, R[i]-min);
			min = Math.min(min, R[i]);
		}

		System.out.println(ans);

		sc.close();
	}

} Main static boolean[] prime; prime public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int n = sc.nextInt();
		int[] R = new int[n];
		for (int i=0; i<n; i++) {
			R[i] = sc.nextInt();
		}

		int ans = -2000000000;
		int min = R[0];
		for (int i=1; i<n; i++) {
			ans = Math.max(ans, R[i]-min);
			min = Math.min(min, R[i]);
		}

		System.out.println(ans);

		sc.close();
	} main {
		Scanner sc = new Scanner(System.in);

		int n = sc.nextInt();
		int[] R = new int[n];
		for (int i=0; i<n; i++) {
			R[i] = sc.nextInt();
		}

		int ans = -2000000000;
		int min = R[0];
		for (int i=1; i<n; i++) {
			ans = Math.max(ans, R[i]-min);
			min = Math.min(min, R[i]);
		}

		System.out.println(ans);

		sc.close();
	} Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int n = sc.nextInt(); n sc.nextInt() sc.nextInt sc int[] R = new int[n]; R new int[n] n for (int i=0; i<n; i++) {
			R[i] = sc.nextInt();
		} int i=0; int i=0; i 0 i<n i n i++ i++ i {
			R[i] = sc.nextInt();
		} {
			R[i] = sc.nextInt();
		} R[i] = sc.nextInt() R[i] R i sc.nextInt() sc.nextInt sc int ans = -2000000000; ans -2000000000 2000000000 int min = R[0]; min R[0] R 0 for (int i=1; i<n; i++) {
			ans = Math.max(ans, R[i]-min);
			min = Math.min(min, R[i]);
		} int i=1; int i=1; i 1 i<n i n i++ i++ i {
			ans = Math.max(ans, R[i]-min);
			min = Math.min(min, R[i]);
		} {
			ans = Math.max(ans, R[i]-min);
			min = Math.min(min, R[i]);
		} ans = Math.max(ans, R[i]-min) ans Math.max(ans, R[i]-min) Math.max Math ans R[i]-min R[i] R i min min = Math.min(min, R[i]) min Math.min(min, R[i]) Math.min Math min R[i] R i System.out.println(ans) System.out.println System.out System System.out ans sc.close() sc.close sc String[] args args public class Main {

	static boolean[] prime;

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

		int n = sc.nextInt();
		int[] R = new int[n];
		for (int i=0; i<n; i++) {
			R[i] = sc.nextInt();
		}

		int ans = -2000000000;
		int min = R[0];
		for (int i=1; i<n; i++) {
			ans = Math.max(ans, R[i]-min);
			min = Math.min(min, R[i]);
		}

		System.out.println(ans);

		sc.close();
	}

} public class Main {

	static boolean[] prime;

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

		int n = sc.nextInt();
		int[] R = new int[n];
		for (int i=0; i<n; i++) {
			R[i] = sc.nextInt();
		}

		int ans = -2000000000;
		int min = R[0];
		for (int i=1; i<n; i++) {
			ans = Math.max(ans, R[i]-min);
			min = Math.min(min, R[i]);
		}

		System.out.println(ans);

		sc.close();
	}

} Main
import java.util.Scanner;

public class Main {

	static boolean[] prime;

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

		int n = sc.nextInt();
		int[] R = new int[n];
		for (int i=0; i<n; i++) {
			R[i] = sc.nextInt();
		}

		int ans = -2000000000;
		int min = R[0];
		for (int i=1; i<n; i++) {
			ans = Math.max(ans, R[i]-min);
			min = Math.min(min, R[i]);
		}

		System.out.println(ans);

		sc.close();
	}

}