import java.util.*;
import java.io.*;
import java.math.BigInteger;
 
public class Main {
	public static void main(String[] args) {
	Scanner s = new Scanner(System.in);
	int N = s.nextInt();
	int[] A = new int[N];
	
	for(int i = 0; i < N; i++){
		A[i] = s.nextInt();
	}

	int max = A[0];
	long count = 0;
	for(int i = 1; i < N; i++){
		if(max<A[i]){
			max = A[i];
		}else{
			count = count + (max - A[i]);
		}
	}
	
	
	System.out.println(count);
	

    
  }
}
/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