import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static string[] s_rd;
T RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
string RDR()() { return readln.chomp; }
T[] ARR(T = long)(in string str, T fix = 0) { auto r = str.split.to!(T[]); r[] += fix; return r; }
size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
long lcm(long x, long y) { return x * y / gcd(x, y); }

long mod = 10^^9 + 7;
//long mod = 998244353;
void moda(ref long x, long y) { x = (x + y) % mod; }
void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(ref long x, long y) { x = (x * y) % mod; }

void main()
{
	auto N = RD;
	auto SP = new string[2][](N);

	foreach (i; 0..N)
	{
		auto S = RD!string;
		auto P = RD!string;
		SP[i] = [S, P];
	}

	auto index = MAKE_IDX!("a[0] < b[0]")(SP);
	auto ans = new long[](N);
	long[] pool;
	string last;
	long cnt;
	foreach (i; index)
	{
		if (last == SP[i][0])
		{
			pool ~= i;
		}
		else
		{
			long[2][] ps;
			foreach (j; pool)
			{
				ps ~= [j, SP[j][1].to!long];
			}
			auto index2 = MAKE_IDX!("a[1] > b[1]")(ps);
			
			foreach (j; index2)
			{
				auto num = ps[j][0];
				ans[cnt] = num;
				++cnt;
			}
			last = SP[i][0];
			pool.length = 0;
			pool ~= i;
		}
	}
	long[2][] ps;
	foreach (j; pool)
	{
		ps ~= [j, SP[j][1].to!long];
	}
	auto index2 = MAKE_IDX!("a[1] > b[1]")(ps);

	foreach (j; index2)
	{
		auto num = ps[j][0];
		ans[cnt] = num;
		++cnt;
	}
	
	foreach (e; ans)
		writeln(e+1);
	stdout.flush();
	debug readln();
}