import java.util.Scanner;

public class Main {
	private static Scanner sc;

	public static void main(String[] args) {
		sc = new Scanner(System.in);
		int n = Integer.parseInt(sc.next());
		long result = 0;
		long nowHighestLength = 0;
		for (int i = 0; i < n; i++) {
			long numberILength = Long.parseLong(sc.next());
			if (nowHighestLength < numberILength) {
				nowHighestLength = numberILength;
			} else {
				result += nowHighestLength - numberILength;
			}
		}
		System.out.println(result);
		
		
	}	

}

/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