import java.util.*;
public class Main{
	public static void main(String[] args){
    	Scanner sc = new Scanner(System.in);
      	int n = sc.nextInt();
      	int[] a = new int[n];
      	int max = 0;
      	for(int i=0; i<n; i++){
        	a[i] = sc.nextInt();
        }
      	for(int j=0; j<n; j++){
        	for(int k=0; k<=j; k++){
            	if(Math.abs(a[j]-a[k])>max){
                	max = Math.abs(a[j]-a[k]);
                }
            }
        }
      	System.out.println(max);
    }
} import java.util.*; util.* java public class Main{
	public static void main(String[] args){
    	Scanner sc = new Scanner(System.in);
      	int n = sc.nextInt();
      	int[] a = new int[n];
      	int max = 0;
      	for(int i=0; i<n; i++){
        	a[i] = sc.nextInt();
        }
      	for(int j=0; j<n; j++){
        	for(int k=0; k<=j; k++){
            	if(Math.abs(a[j]-a[k])>max){
                	max = Math.abs(a[j]-a[k]);
                }
            }
        }
      	System.out.println(max);
    }
} Main public static void main(String[] args){
    	Scanner sc = new Scanner(System.in);
      	int n = sc.nextInt();
      	int[] a = new int[n];
      	int max = 0;
      	for(int i=0; i<n; i++){
        	a[i] = sc.nextInt();
        }
      	for(int j=0; j<n; j++){
        	for(int k=0; k<=j; k++){
            	if(Math.abs(a[j]-a[k])>max){
                	max = Math.abs(a[j]-a[k]);
                }
            }
        }
      	System.out.println(max);
    } main {
    	Scanner sc = new Scanner(System.in);
      	int n = sc.nextInt();
      	int[] a = new int[n];
      	int max = 0;
      	for(int i=0; i<n; i++){
        	a[i] = sc.nextInt();
        }
      	for(int j=0; j<n; j++){
        	for(int k=0; k<=j; k++){
            	if(Math.abs(a[j]-a[k])>max){
                	max = Math.abs(a[j]-a[k]);
                }
            }
        }
      	System.out.println(max);
    } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int n = sc.nextInt(); n sc.nextInt() sc.nextInt sc int[] a = new int[n]; a new int[n] n int max = 0; max 0 for(int i=0; i<n; i++){
        	a[i] = sc.nextInt();
        } int i=0; int i=0; i 0 i<n i n i++ i++ i {
        	a[i] = sc.nextInt();
        } {
        	a[i] = sc.nextInt();
        } a[i] = sc.nextInt() a[i] a i sc.nextInt() sc.nextInt sc for(int j=0; j<n; j++){
        	for(int k=0; k<=j; k++){
            	if(Math.abs(a[j]-a[k])>max){
                	max = Math.abs(a[j]-a[k]);
                }
            }
        } int j=0; int j=0; j 0 j<n j n j++ j++ j {
        	for(int k=0; k<=j; k++){
            	if(Math.abs(a[j]-a[k])>max){
                	max = Math.abs(a[j]-a[k]);
                }
            }
        } {
        	for(int k=0; k<=j; k++){
            	if(Math.abs(a[j]-a[k])>max){
                	max = Math.abs(a[j]-a[k]);
                }
            }
        } for(int k=0; k<=j; k++){
            	if(Math.abs(a[j]-a[k])>max){
                	max = Math.abs(a[j]-a[k]);
                }
            } int k=0; int k=0; k 0 k<=j k j k++ k++ k {
            	if(Math.abs(a[j]-a[k])>max){
                	max = Math.abs(a[j]-a[k]);
                }
            } {
            	if(Math.abs(a[j]-a[k])>max){
                	max = Math.abs(a[j]-a[k]);
                }
            } if(Math.abs(a[j]-a[k])>max){
                	max = Math.abs(a[j]-a[k]);
                } Math.abs(a[j]-a[k])>max Math.abs(a[j]-a[k]) Math.abs Math a[j]-a[k] a[j] a j a[k] a k max {
                	max = Math.abs(a[j]-a[k]);
                } max = Math.abs(a[j]-a[k]) max Math.abs(a[j]-a[k]) Math.abs Math a[j]-a[k] a[j] a j a[k] a k System.out.println(max) System.out.println System.out System System.out max String[] args args public class Main{
	public static void main(String[] args){
    	Scanner sc = new Scanner(System.in);
      	int n = sc.nextInt();
      	int[] a = new int[n];
      	int max = 0;
      	for(int i=0; i<n; i++){
        	a[i] = sc.nextInt();
        }
      	for(int j=0; j<n; j++){
        	for(int k=0; k<=j; k++){
            	if(Math.abs(a[j]-a[k])>max){
                	max = Math.abs(a[j]-a[k]);
                }
            }
        }
      	System.out.println(max);
    }
} public class Main{
	public static void main(String[] args){
    	Scanner sc = new Scanner(System.in);
      	int n = sc.nextInt();
      	int[] a = new int[n];
      	int max = 0;
      	for(int i=0; i<n; i++){
        	a[i] = sc.nextInt();
        }
      	for(int j=0; j<n; j++){
        	for(int k=0; k<=j; k++){
            	if(Math.abs(a[j]-a[k])>max){
                	max = Math.abs(a[j]-a[k]);
                }
            }
        }
      	System.out.println(max);
    }
} Main
import java.util.*;
public class Main{
	public static void main(String[] args){
    	Scanner sc = new Scanner(System.in);
      	int n = sc.nextInt();
      	int[] a = new int[n];
      	int max = 0;
      	for(int i=0; i<n; i++){
        	a[i] = sc.nextInt();
        }
      	for(int j=0; j<n; j++){
        	for(int k=0; k<=j; k++){
            	if(Math.abs(a[j]-a[k])>max){
                	max = Math.abs(a[j]-a[k]);
                }
            }
        }
      	System.out.println(max);
    }
}