#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <limits.h>

int generateSequences(int* nums, int n, int pos, int* current, int isIncreasing, int minRange, int maxRange) {
    if (pos == n) {
        int cost = 0;
        for (int i = 0; i < n; i++) {
            cost += abs(nums[i] - current[i]);
        }
        return cost;
    }
    
    int minCost = INT_MAX;
    int start = pos > 0 ? current[pos-1] : minRange;
    
    for (int val = start; val <= maxRange && val <= start + 100; val++) {
        if (pos == 0 || (isIncreasing && val >= current[pos-1]) || (!isIncreasing && val <= current[pos-1])) {
            current[pos] = val;
            int cost = generateSequences(nums, n, pos + 1, current, isIncreasing, minRange, maxRange);
            if (cost < minCost) {
                minCost = cost;
            }
        }
    }
    
    return minCost;
}

int solution(int* nums, int n) {
    if (n <= 1) return 0;
    
    int minVal = nums[0], maxVal = nums[0];
    for (int i = 1; i < n; i++) {
        if (nums[i] < minVal) minVal = nums[i];
        if (nums[i] > maxVal) maxVal = nums[i];
    }
    
    int rangeVal = maxVal - minVal;
    int* current = (int*)malloc(n * sizeof(int));
    
    int nonDecCost = generateSequences(nums, n, 0, current, 1, minVal - rangeVal, maxVal + rangeVal);
    int nonIncCost = generateSequences(nums, n, 0, current, 0, minVal - rangeVal, maxVal + rangeVal);
    
    free(current);
    return nonDecCost < nonIncCost ? nonDecCost : nonIncCost;
}

int main() {
    char line[10000];
    fgets(line, sizeof(line), stdin);
    
    int nums[1000];
    int n = 0;
    char* token = strtok(line + 1, ",]");
    while (token != NULL) {
        nums[n++] = atoi(token);
        token = strtok(NULL, ",]");
    }
    
    printf("%d\n", solution(nums, n));
    return 0;
}