{"id":"32rrphSest","url":"https://pastebin.ca/32rrphSest","raw_url":"https://raw.anybin.ca/32rrphSest","visibility":"public","access":"public","created_at":1783177590734,"expires_at":1783782390734,"fetch_limit":null,"fetches_used":0,"reads_remaining":null,"size_bytes":605,"syntax_hint":null,"title":null,"filename":null,"change_note":null,"cipher":null,"cipher_meta":null,"parent_id":null,"root_id":"32rrphSest","version":1,"owner_id":null,"recipient_id":null,"body":"import sys\n\n\ndef solve():\n    raw = list(map(int, sys.stdin.read().split()))\n    if not raw:\n        return\n    n, c = raw[0], raw[1:]\n\n    for T in ((n - 1) - c[0], (n - 1) - c[0] + 1):\n        if 0 <= T <= n:\n            a, P = [], 0\n            for i, ci in enumerate(c, 1):\n                ai = ci + T - (n - i) - 2 * P\n                if ai not in (0, 1):\n                    break\n                a.append(ai)\n                P += ai\n            if len(a) == n and P == T:\n                print(\"possible\\n\" + \"\".join(\"><\"[1 - x] for x in a))\n                return\n    print(\"impossible\")\n\n\nsolve()"}