#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <assert.h>
#include <iostream>
#include <sstream>
#include <vector>
#include <string>
#include <math.h>
#include <queue>
#include <list>
#include <algorithm>
#include <map>
#include <set>
#include <stack>
#include <ctime>
#include <iomanip>
#include <fstream>
#include <random>
#include <numeric>
using namespace std;

#define ALL(c) (c).begin(),(c).end()
#define PB push_back
#define IN(x,c) (find(c.begin(),c.end(),x) != (c).end())
#define REP(i,n) for (int i=0;i<(int)(n);i++)
#define FOR(i,a,b) for (int i=(a);i<=(b);i++)
#define INIT(a,v) memset(a,v,sizeof(a))
template<class A, class B> A cvt(B x) { stringstream ss; ss<<x; A y; ss>>y; return y; }
template<class A> ostream& operator<<(ostream &os, vector<A> &v) { REP (i,v.size()) { if (i!=0) os << " "; os << v[i]; } return os; }

#define SPC << " " <<
#define DEBUG(x) cerr << #x << " = "; cerr << x << endl;
#define DEBUG_ITER(x) cerr << #x << " = "; for (auto _ : x) cerr << _ << ' '; cerr << endl;

typedef pair<int,int> PII;
typedef long long int64;
typedef vector<int> VI;
typedef vector<PII> VII;
typedef vector<double> VD;

int n;
vector<int> adj[100];

mt19937 rnd;

int main() {
	map<string, int> starost;
	starost["miha"]= 14;
	starost["ana"] = 37;
	starost["tine"] = 9;
	for (auto item : starost) {
		cout << item.first << " " << item.second << endl;
	}
	for (auto [key, value] : starost) {
		cout << key << " " << value << endl;
	}
	/*
	set<int> s;
	REP (i,1000000) {
		s.insert(rnd()%100000000);
	}
	cout << s.size() << endl;
	auto it = s.lower_bound(500);
	cout << *it << endl;
	*/
	/*
	priority_queue<int> pq;
	cin >> n;
	REP (i,n) {
		int x;
		cin >> x;
		pq.push(x);
	}
	while (!pq.empty()) {
		cout << pq.top() << endl;
		pq.pop();
	}
	*/
	/*
	stack<PII> s;
	s.push({99999, -1});
	cin >> n;
	VI a(n);
	REP (i,n) cin >> a[i];
	REP (i,n) {
		while (s.top().first < a[i]) s.pop();
		printf("%d: %d\n", i, s.top().second);
		s.push({a[i], i});
	}
	*/
	/*
	cin >> n;
	REP (i,n) {
		int x,y;
		cin >> x >> y;
		adj[x].PB(y);
		adj[y].PB(x);
	}
	*/
	return 0;
}