//! 尺卂乃卂.卂ﾌ乇乇ㄒ
#include<bits/stdc++.h>
//#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
//Using namespace __gnu_pbds;
//typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> Ordered_set;

#define ll              long long
#define int             long long
#define ld             long double
#define pb              push_back
#define pii             pair<int,int>
#define vi              vector<int>
#define vii             vector<vi>
#define vip            vector<pii>
#define mii             map<int,int>
#define mip             map<pair<int,int>,int>
#define mic             map<char,int> 
#define all(v)          v.begin(),v.end()  
#define pqb             priority_queue<int>
#define pqs             priority_queue<int,vi,greater<int> >
#define setbits(x)      __builtin_popcountll(x)
#define zrobits(x)      __builtin_ctzll(x)
#define lb(x)           (x&(-x))
#define mod             1000000007
#define inf             1e18
#define ps(x,y)         fixed<<setprecision(y)<<x
#define w(x)            int x; cin>>x; while(x--)
#define itr(it,v)          for(auto it:v)
#define show(arr,n)     for(int i=0;i<n;i++) cout<<arr[i]<<" "; cout<<"\n";
#define fi(i,n)         for(int i=0;i<n;i++)
#define fir(i,k,n)       for(int i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ff               first 
#define ss               second
#define deb(x) cout << #x << "=" << x << endl
#define FIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define check(x) (x && cout<<"Yes\n")||(cout<<"No\n");
#define fin(s)          freopen(s,"r",stdin);  
#define fout(s)         freopen(s,"w",stdout);

const ld pi = 3.141592653589793238462643383279502884;
const int xd[]={-1,0,1,0};
const int yd[]={0,-1,0,1};
int XX[] = { -1, -1, -1, 0, 0, 1, 1, 1 };
int YY[] = { -1, 0,  1, -1, 1, -1, 0, 1 };

int expo(int a,int b,int m);
int mmi(int a,int m);
void ipgraph(int m);

const int N=5*(1e5)+10;
vii adj(N);
int a[N];

void  solve(){

}
int32_t main()
{
    FIO
    int n; cin>>n;
    cout<<ceil(n/100.0)<<"\n";
    return 0;

}

void ipgraph(int m){
    int i, u, v;
    while(m--){
          cin>>u>>v;
         u--, v--;
    adj[u].pb(v);
    adj[v].pb(u);
    }
}
int expo(int a,int b,int m){
    if(b==0) return 1;
    if(b==1) return a;
    int val=(expo(a,b/2,m)*expo(a,b/2,m))%m;
    if(b & 1) return (val*a)%m;
    else return val;
}
int mmi(int a,int m){
    return expo(a,m-2,m);
}
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <cstring>
#include <utility>
#include <numeric>

using namespace std;

vector<vector<int>> tree;

pair<int, int> getPointAndChildCnt(int node){
    
    int firstPoint = -1;
    int restPoint = 0;
    int childCnt = 0;
    vector<pair<int, int>> pointList;
    for(int i = 0; i < (int)tree[node].size(); i++){
        int nextNode = tree[node][i];

        auto temp = getPointAndChildCnt(nextNode);
        childCnt += temp.second;

        if(temp.first >= 0){
            if(temp.second % 2 == 0){
                firstPoint += temp.first;
            }
            else{
                pointList.emplace_back(make_pair(-2, temp.first));
            }
        }
        else{
            if(temp.second % 2 == 0){
                restPoint += temp.first;
            }
            else{
                pointList.emplace_back(make_pair(-3, temp.first));
            }
        }
    }

    sort(pointList.begin(), pointList.end(), greater<pair<int, int>>());

    int turn = 1;
    int ret = firstPoint;
    // cout << "node:" << node << endl; 
    // cout << "f" << firstPoint << endl;
    for(auto temp: pointList){
        // cout << temp.second << endl;
        ret += temp.second * turn;
        turn *= -1;
    }
    // cout << "r" << restPoint << endl;
    ret += restPoint * turn;

    pair<int, int> retPair = make_pair(ret, childCnt + 1);

    return retPair;
}

int main(){

    int n;
    cin >> n;
    vector<int> p(n);
    p[0] = -1;
    for(int i = 1; i < n; i++){
        cin >> p[i];
        p[i]--;
    }

    tree.resize(n);
    for(int i = 1; i < n; i++){
        tree[p[i]].push_back(i);
    }

    auto data = getPointAndChildCnt(0);

    int aokiPlus = data.first;

    int ans = (n - aokiPlus) / 2;

    cout << ans << endl;

    return 0;
}