#include<bits/stdc++.h>
using namespace std;
int main(){
    unordered_set<int>s;
    s.insert(2);
    s.insert(5);
    s.insert(5);
    if(s.find(2)!=s.end()) cout<<"Found";
    else cout<<"Not found"; 
    cout<<"\n";
    
    set<int>t;
    t.insert(2);
    t.insert(5);t.insert(5);
    if(t.find(2)!=t.end())cout<<"Found";
    else cout<<"Not found";
    cout<<"\n";
    
    map<int,int>n;
    n[2]=1;n[5]=2;
    if(n.find(2)!=n.end())cout<<"Found";else cout<<"Not found";cout<<"\n";
    cout<<n[5];cout<<"\n";
    return 0;
}