import java.io.*; import java.util.*; import java.util.concurrent.ThreadLocalRandom; import java.util.function.IntUnaryOperator; import java.util.function.LongUnaryOperator; import java.util.stream.Collectors; public class Main { static boolean isLocal; Random rand = new Random(); In in = new In(System.in); PrintStream out = System.out; long inf = 0x1fffffffffffffffL; int iinf = 0x3fffffff; long startTime; int dist(int a, int b, int n) { return Math.min(Math.abs(a - b), n - Math.abs(a - b)); } long solve(int seed) { // Trial tr = ((NormalDebugger)this).trial; // double aa = tr.getParameterDouble("aa"); // double bb = tr.getParameterDouble("bb"); // double cc = tr.getParameterDouble("cc"); startTime = System.currentTimeMillis(); if (isLocal) { int[] p = in.nextIntArray(25); } int lv = 1; int pc = 0; int x = 12; Monster[] monsters = new Monster[5000]; Map remain = new HashMap<>(); int mid = 0; int score = 0; for (int i = 0; i < 1000; i++) { System.out.flush(); int n = in.nextInt(); if (n == -1) { break; } remain.values().removeIf(monster -> { monster.y--; return monster.y < 0; }); for (int j = 0; j < n; j++) { int mh = in.nextInt(); int mp = in.nextInt(); int mx = in.nextInt(); monsters[mid] = new Monster(mid, mx, 59, mh, mp); remain.put(mid, monsters[mid]); mid++; } int[] miny = new int[25]; Arrays.fill(miny, 60); for (Monster monster : remain.values()) { miny[monster.x] = Math.min(miny[monster.x], monster.y); } Monster target = null; double md = iinf; for (Monster monster : remain.values()) { int dist = dist(monster.x, x, 25); int turn = dist + (monster.r + lv - 1) / lv; if (monster.y - turn <= 0 || miny[monster.x] != monster.y) { continue; } double val = (monster.y + dist*10)*(i/1000.+0.25) + ((double)monster.h / (monster.p + 1))*(1-i/1000.) * 50; // int val = monster.y + dist*10;// + monster.h * 100 / (monster.p + 1); if (target == null || md > val) { target = monster; md = val; } } // if (isLocal && target != null) { // debug(Arrays.toString(miny)); // debug(i, target.x, x, dist(target.x, x, 25), md, remain.size()); // } if (target == null) { if (miny[x] == 1 && miny[(x+1)%25]>=3) { x = (x + 1) % 25; out.println("R"); } else if (miny[x] == 1 && miny[(x+24)%25]>=3) { x = (x + 24) % 25; out.println("L"); } else { out.println("S"); } } else if (miny[(x+24)%25]>=3 && (Math.abs(target.x - x) < 12 ? target.x < x : target.x > x)) { x = (x + 24) % 25; out.println("L"); } else if (miny[(x+1)%25]>=3 && (Math.abs(target.x - x) < 12 ? target.x > x : target.x < x)) { x = (x + 1) % 25; out.println("R"); } else if (miny[x] == 2 && miny[(x+1)%25]>=3) { x = (x + 1) % 25; out.println("R"); } else if (miny[x] == 2 && miny[(x+24)%25]>=3) { x = (x + 24) % 25; out.println("L"); } else { out.println("S"); } Monster attack = null; for (Monster monster : remain.values()) { if (monster.x != x) { continue; } if (attack == null || monster.y < attack.y) { attack = monster; } } if (attack != null) { attack.r -= lv; if (attack.r < 0) { pc += attack.p; lv = 1 + pc / 100; score += attack.h; remain.remove(attack.id); } } } return score; } static class Monster { int id; int x; int y; int h; int r; int p; public Monster(int id, int x, int y, int h, int p) { this.id = id; this.x = x; this.y = y; this.h = h; this.r = h; this.p = p; } } static void debug(Object... args) { if (!isLocal) { return; } if (args == null || args.getClass() != Object[].class) { args = new Object[] {args}; } System.err.println(Arrays.stream(args).map(obj -> { Class clazz = obj == null ? null : obj.getClass(); return clazz == byte[].class ? Arrays.toString((byte[])obj) : clazz == short[].class ? Arrays.toString((short[])obj) : clazz == int[].class ? Arrays.toString((int[])obj) : clazz == long[].class ? Arrays.toString((long[])obj) : clazz == char[].class ? Arrays.toString((char[])obj) : clazz == float[].class ? Arrays.toString((float[])obj) : clazz == double[].class ? Arrays.toString((double[])obj) : clazz == boolean[].class ? Arrays.toString((boolean[])obj) : obj instanceof Object[] ? Arrays.deepToString((Object[])obj) : String.valueOf(obj); }).collect(Collectors.joining(" "))); } long elapsed() { return (long)((System.currentTimeMillis() - startTime) * (isLocal ? 1.7 : 1)); } boolean elapsed(long timeLimit) { return elapsed() >= timeLimit; } public static void main(String[] args) { new Main().solve(0); } static class Random { private long x, y, z, w; Random() { this(ThreadLocalRandom.current().nextLong()); } Random(long seed) { this.x = seed; for (int i = 0; i < 20; i++) { rand(); } } private long rand() { long t = x ^ (x << 11); x = y; y = z; z = w; w = w ^ (w >>> 19) ^ t ^ (t >>> 8); return x & 0x7fffffff; } long next() { return rand() << 31 | rand(); } int next(int n) { return (int)(rand() % n); } int next(int l, int r) { return (int)(rand() % (r - l) + l); } double nextDouble() { return rand() / 2147483647.0; } } static class In { private final BufferedReader reader; private StringTokenizer tokenizer; In(InputStream input) { this.reader = new BufferedReader(new InputStreamReader(input), 0x10000); } String next() { try { while (tokenizer == null || !tokenizer.hasMoreTokens()) { tokenizer = new StringTokenizer(reader.readLine()); } } catch (IOException ignored) { } return tokenizer.nextToken(); } int nextInt() { return Integer.parseInt(next()); } long nextLong() { return Long.parseLong(next()); } double nextDouble() { return Double.parseDouble(next()); } char[] nextCharArray() { return next().toCharArray(); } String[] nextStringArray(int n) { String[] s = new String[n]; for (int i = 0; i < n; i++) { s[i] = next(); } return s; } char[][] nextCharGrid(int n, int m) { char[][] a = new char[n][m]; for (int i = 0; i < n; i++) { a[i] = next().toCharArray(); } return a; } int[] nextIntArray(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) { a[i] = nextInt(); } return a; } int[] nextIntArray(int n, IntUnaryOperator op) { int[] a = new int[n]; for (int i = 0; i < n; i++) { a[i] = op.applyAsInt(nextInt()); } return a; } int[][] nextIntMatrix(int h, int w) { int[][] a = new int[h][w]; for (int i = 0; i < h; i++) { a[i] = nextIntArray(w); } return a; } long[] nextLongArray(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) { a[i] = nextLong(); } return a; } long[] nextLongArray(int n, LongUnaryOperator op) { long[] a = new long[n]; for (int i = 0; i < n; i++) { a[i] = op.applyAsLong(nextLong()); } return a; } long[][] nextLongMatrix(int h, int w) { long[][] a = new long[h][w]; for (int i = 0; i < h; i++) { a[i] = nextLongArray(w); } return a; } List> nextEdges(int n, int m, boolean directed) { List> res = new ArrayList<>(); for (int i = 0; i < n; i++) { res.add(new ArrayList<>()); } for (int i = 0; i < m; i++) { int u = nextInt() - 1; int v = nextInt() - 1; res.get(u).add(v); if (!directed) { res.get(v).add(u); } } return res; } } }