#include <bits/stdc++.h>
using namespace std;

int main() {
	int n;
	cin >> n;
	
	vector<int> arr(n);
	
	for(int i=0; i<n; i++) {
		cin >> arr[i];
	}
	
	int k;
	cin >> k;
	
	if (n == 1) {
        cout << "Minimum Jumps : 0\n";
        return 0;
    }
    
	vector<int> dp(n, 0);
	
	dp[0] = 0;
	
	dp[1] = abs(arr[0] - arr[1]);
	
	for(int i=2; i<n; i++) {
		int answer = INT_MAX;
		
		int j = 1;
		while(j<=k && i-j>=0) {
			// i - j ---> i
			int option = dp[i-j] + abs(arr[i] - arr[i-j]);
			answer = min(answer, option);
			j++;
		}
		dp[i] = answer;
	}
	
	cout << "Minimum Jumps : " << dp[n-1];
	
	return 0;
}