TREES PASCAL

var a:array[1..1000000] of longint;
    n,minn,res:longint;
procedure nhap;
var i:longint;
begin
    readln(n);
    for i:=1 to n do read(a[i]);
end;

procedure tim_min;
var i:longint; 
begin
    minn:=a[1];
    for i:=2 to n do
        if a[i]<minn then 
            minn:=a[i];
end;

procedure tinh;
var i:longint;
begin
    res:=0;
    for i:=1 to n do 
        res:=res+(a[i]-minn);
    writeln(res);
end;


begin
    assign(input,'trees.inp');reset(input);
    assign(output,'trees.out');rewrite(output);
    nhap;
    tim_min;
    tinh;
end.