/// Msaa el 5ra
#pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include "bits/stdc++.h"

using namespace std;

#define pb push_back
#define F first
#define S second
#define f(i, a, b)  for(int i = a; i < b; i++)
#define all(a)  a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define sz(x) (int)(x).size()
#define mp(x, y) make_pair(x,y)
#define popCnt(x) (__builtin_popcountll(x))
#define int ll

using ll = long long;
using ii = pair<int, int>;
using ull = unsigned long long;

const int N = 5e5 + 5, LG = 18, MOD = 1e9 + 7;
const long double PI = acos(-1);
const long double EPS = 1e-7;

long double calc(pair<string, int> a) {
    if (a.F == "cube")return sqrtl(2.0L) * a.S;
    return a.S * 2;
}

void doWork() {

    int n;
    cin >> n;
    vector<pair<string, int>> vs(n);
    f(i, 0, n) {
        cin >> vs[i].F >> vs[i].S;
    }
    sort(all(vs), [&](pair<string, int> a, pair<string, int> b) {
        return calc(a) < calc(b);
    });

    f(i, 1, n) {
        if (vs[i - 1].F == "cylinder" && vs[i].F == "cube" && vs[i - 1].S * 2 > vs[i].S) {
            cout << "impossible\n";
            return;
        }
    }
    f(i, 0, n) cout << vs[i].F << ' ' << vs[i].S << '\n';
}

int32_t main() {
#ifdef ONLINE_JUDGE
    ios_base::sync_with_stdio(0);
    cin.tie(0);
#endif // ONLINE_JUDGE

    int t = 1;
//    cin >> t;
    while (t--) {
        doWork();
    }
}