
import java.util.Scanner;

public class Main {
    
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        
        final int N = sc.nextInt();
        
        int currTop = 0;
        long steps = 0;
        
        for (int i = 0; i < N; i++) {
            int A = sc.nextInt(); 
            
            if (A < currTop) {
                steps += currTop - A;
            } else if (currTop < A) {
                currTop = A;
            }
        }
        
        System.out.println(steps);
    }
}

/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