#include<bits/stdc++.h>
using namespace std;
struct node{
int id;
int pri;
};
bool operator <( const node & a, const node & b)
{
if(a.pri==b.pri) return a.id>b.id;
return a.pri<b.pri;
}
priority_queue<node>que1;
int main()
{
node p[1005];
int k=1;
for(int i=0;i<5;i++)
{
cin>>p[i].pri;
p[i].id=k++;
cout<<"hhh"<<endl;
que1.push(p[i]);
}
while(!que1.empty())
{
cout<<que1.top().id<<' '<<que1.top().pri<<endl;
que1.pop();
}
}