import java.util.Scanner;

public class Main {

	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 maxProfit = -2000000000;
		int minProfit = R[0];

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

		System.out.println(maxProfit);

		sc.close();
	}
}
 import java.util.Scanner; Scanner java.util public class Main {

	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 maxProfit = -2000000000;
		int minProfit = R[0];

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

		System.out.println(maxProfit);

		sc.close();
	}
} Main 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 maxProfit = -2000000000;
		int minProfit = R[0];

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

		System.out.println(maxProfit);

		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 maxProfit = -2000000000;
		int minProfit = R[0];

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

		System.out.println(maxProfit);

		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 maxProfit = -2000000000; maxProfit -2000000000 2000000000 int minProfit = R[0]; minProfit R[0] R 0 for (int i = 1; i < n; i++) {
			maxProfit = Math.max(maxProfit, R[i] - minProfit);
			minProfit = Math.min(minProfit, R[i]);
		} int i = 1; int i = 1; i 1 i < n i n i++ i++ i {
			maxProfit = Math.max(maxProfit, R[i] - minProfit);
			minProfit = Math.min(minProfit, R[i]);
		} {
			maxProfit = Math.max(maxProfit, R[i] - minProfit);
			minProfit = Math.min(minProfit, R[i]);
		} maxProfit = Math.max(maxProfit, R[i] - minProfit) maxProfit Math.max(maxProfit, R[i] - minProfit) Math.max Math maxProfit R[i] - minProfit R[i] R i minProfit minProfit = Math.min(minProfit, R[i]) minProfit Math.min(minProfit, R[i]) Math.min Math minProfit R[i] R i System.out.println(maxProfit) System.out.println System.out System System.out maxProfit sc.close() sc.close sc String[] args args public class Main {

	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 maxProfit = -2000000000;
		int minProfit = R[0];

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

		System.out.println(maxProfit);

		sc.close();
	}
} public class Main {

	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 maxProfit = -2000000000;
		int minProfit = R[0];

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

		System.out.println(maxProfit);

		sc.close();
	}
} Main
import java.util.Scanner;

public class Main {

	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 maxProfit = -2000000000;
		int minProfit = R[0];

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

		System.out.println(maxProfit);

		sc.close();
	}
}

