#include <iostream>
#include <set>
#include <vector>
using namespace std;
typedef long long LL;
int main(int argc, char* argv[])
{
	int N;
	cin>>N;
	vector<LL> A(N,0);
	set<LL> aSet;
	LL x;
	int i;
	for (i=0;i<N;i++){
		cin>>x;
		A[i]=x;
		aSet.insert(x);
	}
	set<LL>::iterator sit;
	LL MinV=1e10;
	LL Sum=0;
	for (sit=aSet.begin();sit!=aSet.end();sit++){
		LL v=(*sit);
		Sum=0;
		for (i=0;i<N;i++){
			x=A[i]-v;
			if (x<0){
				x=-x;
			}
			Sum+=x;
		}
		if (MinV>Sum){
			MinV=Sum;
		}
	}
	cout<<MinV<<endl;
	return 0;
}