#include <iostream>

#include <fstream>

#include <algorithm>

#include <map>

#include <vector>

#include <queue>

#include <string.h>

using namespace std;

ifstream fin("contact.in");

ofstream fout("contact.out");

#define all(c) (c).begin(), (c).end()

#define tr(c,i) for(typeof((c).begin()) i = (c).begin(); i!=(c).end(); i++)

typedef pair<int, int> pii;

typedef pair<int, string> pis;

const int MAXN = 200001;

const int INF = 2100000000;

const int MAX_HASH = 999983;

int N;

string S;

int A,B;

map<int, int> mymap;

typedef struct _node{

string s;

int cnt;

}node;

vector< node> hash[MAX_HASH];

unsigned int hash_func(string &tmp){

}

void insert(string &tmp_sum, int index){

}

int is_in(string &t, int index){

}

int convert(const string &s){

}

bool mycmp(const node &a, const node &b){

}

void work(){

}

int main(){

}