
#include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <numeric>
#include <limits>
#include <type_traits>
#include <locale>
#include <omp.h>

using namespace std;
#define SAY_YES cout << "YES" << endl;
#define SAY_Yes cout << "Yes" << endl;
#define SAY_NO cout << "NO" << endl;
#define SAY_No cout << "No" << endl;
#define IFYES(TRUE_OR_FALSE)   \
    if (TRUE_OR_FALSE)         \
    {                          \
        cout << "YES" << endl; \
    }                          \
    else                       \
    {                          \
        cout << "NO" << endl;  \
    }
#define IFYes(TRUE_OR_FALSE)   \
    if (TRUE_OR_FALSE)         \
    {                          \
        cout << "Yes" << endl; \
    }                          \
    else                       \
    {                          \
        cout << "No" << endl;  \
    }
#define IFyes(TRUE_OR_FALSE)   \
    if (TRUE_OR_FALSE)         \
    {                          \
        cout << "yes" << endl; \
    }                          \
    else                       \
    {                          \
        cout << "no" << endl;  \
    }
#define DEBUG_OUTPUT_ARRAY(XXX, ONE)                            \
    for (int i = 0; i < (ONE); i++)                             \
    {                                                           \
        cout << "DEBUG: i = " << i << " -> " << XXX[i] << endl; \
    }
#define DEBUG_OUTPUT_ARRAY2(XXX, ONE, TWO)                             \
    for (int i = 0; i < (ONE); i++)                                    \
    {                                                                  \
        cout << "<<< i = " << i << " >>>" << endl;                     \
        for (int j = 0; j < (TWO); j++)                                \
        {                                                              \
            cout << "DEBUG: j = " << j << " -> " << XXX[i][j] << endl; \
        }                                                              \
    }
#define DEBUG_OUTPUT_ARRAY2_BOX(XXX, ONE, TWO) \
    for (int i = 0; i < (ONE); i++)            \
    {                                          \
        cout << i << "  ";                     \
        for (int j = 0; j < (TWO); j++)        \
        {                                      \
            cout << XXX[i][j] << " ";          \
        }                                      \
        cout << endl;                          \
    }

typedef pair<long long int, long long int> pll;
typedef pair<long long int, pll> lpll;

const long long int mod = 1000000007;
const long long int INF = 1e18;
const long double PI=3.14159265358979323; 
//const long long int pl=1000000;

long long int N,a[200200],sum=0;
int main(){

    cout << fixed << setprecision(18);
    cin>>N;
    for(long long int i = 0; i < N; i++){
        cin>>a[i];
        sum+=a[i];
        a[i]*=N;
    }
    long long int x=INF;
    for(long long int i = 0; i < N; i++){
        x=min(x,abs(a[i]-sum));
    }
    for(long long int i = 0; i < N; i++){
        if(x==abs(a[i]-sum)){cout<<i<<endl;return 0;}
    }
}


#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int n, k, ans;
int a[maxn];
bool sec[maxn];
vector<int> E[maxn];
int dfs(int x)
{
	int ret = 0;
	for(auto v : E[x])
		ret = max(ret, dfs(v));
	++ret;
	if(ret == k && !sec[x]) ++ans, ret = 0;
	return ret;
}
int main()
{
	scanf("%d%d", &n, &k); 
	for(int i = 1; i <= n; ++i) scanf("%d", &a[i]);
	ans += (a[1] != 1);
	for(int i = 2; i <= n; ++i) E[a[i]].push_back(i);
	sec[1] = 1;
	for(auto v : E[1]) sec[v] = 1;
	dfs(1);
	printf("%d\n", ans);
	return 0;
}