public void Solve()
{
int N = NextInt();
Li list = new Li();
REP(N, _ =>
{
list.Add(NextInt());
});
var tmp = list.OrderBy(_ => _);
int idx = 0;
var dix = new Dictionary <int, int>();
foreach (var item in tmp)
{
if (!dix.ContainsKey(item))
{
dix.Add(item, idx); idx++;
}
}
foreach (var item in list)
{
dix[item].WL();
}
return;
}