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

int main(){
    int n;
    cin>>n;
    vector<int> pages(n);
    for(int i=0;i<n;i++){
        cin>>pages[i];
    }
    int frames;
    cin>>frames;
    
    queue<int> q;
    int PageFaults=0;
    
    for(int i=0;i<n;i++){
        bool found=false;
        queue<int> temp=q;
        
        while(!temp.empty()){
            if(temp.front()==pages[i]){
                found=true;
                break;
            }
            temp.pop();
        }
        if(!found){
            if((int)q.size()==frames){
                q.pop();
            }
            q.push(pages[i]);
            PagesFaults++;
            
        }
        
    }

    
    cout<<"Total Page Faults(FIFO) :"<<PageFaults<<endl;
    return 0;
    
}