import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        int N = s.nextInt();
        long[] A = new long[N];
        long count = 0;

        A[0] = s.nextLong();
        for (int i = 1; i < N; i++) {
            A[i] = s.nextLong();
            if (A[i - 1] > A[i]) {
                count += (A[i - 1] - A[i]);
                A[i] = A[i - 1];
            }
        }

        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