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

// Optimised approach: using frequency map
int main() 
{
    int arr[11] = { 8 , 3 , 5 , 2 , 3 , 1 , 6 , 5 , 7 , 4 , 3};
    int n=11;

    /* 
    Element  frequency
           8             1
           3              3
           5              2
           2              1
           1              1
           6              1
           7              1
           4              1
           
    */
    unordered_map<int,int>frequencymap;
    for(int i=0; i<n; i++)
    {
        frequencymap[arr[i]] = frequencymap[arr[i]] + 1;
    }


    int q;
    cout<<"Enter  No of Queries"<<endl;
    cin>>q;  // 2

    for(int i=0; i<q;  i++)
    {
        int x;
        cout<<"Enter  No to find frequency"<<endl;
        cin>>x;  // 5   6 

        cout<<"Frequency of "<<x<< " = " <<frequencymap[x]<<endl; // 5=2   6=1
    }

    return 0;
}