#include <iostream>
#include <vector>
#include <numeric>
#include <algorithm>
using namespace std;
 
// 0-based indexing
int main() {
    int n;
    cin >> n;
    vector<int> arr(n);
    for (int i = 0; i < n; i++) cin >> arr[i];
 
    int target;
    cin >> target;
 
    int total = accumulate(arr.begin(), arr.end(), 0);
    sort(arr.begin(), arr.end());
 
    int leftInd = distance(arr.begin(), lower_bound(arr.begin(), arr.end(), target));
 
    int sumOfLeftPart = 0;
    for (int i = 0; i < leftInd; i++) {  
        sumOfLeftPart += arr[i];
    }
 
    int leftCount = leftInd;  
    int leftSum = target * leftCount - sumOfLeftPart;
 
    int sumOfRightPart = total - sumOfLeftPart;
    int rightCount = n - leftCount;
    int rightSum = sumOfRightPart - target * rightCount;
 
    cout << leftSum + rightSum << "\n";
    return 0;
}
 

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8dmVjdG9yPgojaW5jbHVkZSA8bnVtZXJpYz4KI2luY2x1ZGUgPGFsZ29yaXRobT4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCi8vIDAtYmFzZWQgaW5kZXhpbmcKaW50IG1haW4oKSB7CiAgICBpbnQgbjsKICAgIGNpbiA+PiBuOwogICAgdmVjdG9yPGludD4gYXJyKG4pOwogICAgZm9yIChpbnQgaSA9IDA7IGkgPCBuOyBpKyspIGNpbiA+PiBhcnJbaV07CgogICAgaW50IHRhcmdldDsKICAgIGNpbiA+PiB0YXJnZXQ7CgogICAgaW50IHRvdGFsID0gYWNjdW11bGF0ZShhcnIuYmVnaW4oKSwgYXJyLmVuZCgpLCAwKTsKICAgIHNvcnQoYXJyLmJlZ2luKCksIGFyci5lbmQoKSk7CgogICAgaW50IGxlZnRJbmQgPSBkaXN0YW5jZShhcnIuYmVnaW4oKSwgbG93ZXJfYm91bmQoYXJyLmJlZ2luKCksIGFyci5lbmQoKSwgdGFyZ2V0KSk7CgogICAgaW50IHN1bU9mTGVmdFBhcnQgPSAwOwogICAgZm9yIChpbnQgaSA9IDA7IGkgPCBsZWZ0SW5kOyBpKyspIHsgIAogICAgICAgIHN1bU9mTGVmdFBhcnQgKz0gYXJyW2ldOwogICAgfQoKICAgIGludCBsZWZ0Q291bnQgPSBsZWZ0SW5kOyAgCiAgICBpbnQgbGVmdFN1bSA9IHRhcmdldCAqIGxlZnRDb3VudCAtIHN1bU9mTGVmdFBhcnQ7CgogICAgaW50IHN1bU9mUmlnaHRQYXJ0ID0gdG90YWwgLSBzdW1PZkxlZnRQYXJ0OwogICAgaW50IHJpZ2h0Q291bnQgPSBuIC0gbGVmdENvdW50OwogICAgaW50IHJpZ2h0U3VtID0gc3VtT2ZSaWdodFBhcnQgLSB0YXJnZXQgKiByaWdodENvdW50OwoKICAgIGNvdXQgPDwgbGVmdFN1bSArIHJpZ2h0U3VtIDw8ICJcbiI7CiAgICByZXR1cm4gMDsKfQo=

NQoxIDIgMyAxMCAxMgo1Cg==

5
1 2 3 10 12
5