#include<iostream>
 #include<algorithm>
 using namespace std;
 
 int main()
 {
    int n;
    int count;
    int max;
    int K;
    while(cin>>n)
    {
        int arr[105];
        max=n;
        count=0;
        for(int i=0;i<n;i++) cin>>arr[i];
        cin>>K;
        sort(arr,arr+n);
        for(int i=1;i<n;i++)
        {
            if(arr[i]-arr[i-1]==0) count++;
        }
        if(K<=count) cout<<(max-count)<<endl;
        else cout<<(max-K)<<endl;        
    }
     return 0;
 }