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

int solution(int* nums, int n) {
    int pos_1 = -1, pos_n = -1;
    
    // Find positions of 1 and n
    for (int i = 0; i < n; i++) {
        if (nums[i] == 1) pos_1 = i;
        if (nums[i] == n) pos_n = i;
    }
    
    // Calculate minimum swaps needed
    int swaps = pos_1 + (n - 1 - pos_n);
    
    // If 1 is to the right of n, we can save 1 swap
    if (pos_1 > pos_n) {
        swaps -= 1;
    }
    
    return swaps;
}

int main() {
    char line[1000];
    fgets(line, sizeof(line), stdin);
    
    // Parse array manually
    int nums[100];
    int n = 0;
    char* ptr = line;
    while (*ptr) {
        if (*ptr >= '0' && *ptr <= '9') {
            nums[n++] = strtol(ptr, &ptr, 10);
        } else {
            ptr++;
        }
    }
    
    printf("%d\n", solution(nums, n));
    return 0;
}