import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    static void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
    /*    String[]    moves = {};
        int         i = 0;
        while (i_start != i_end && j_start != j_end && i < 10)
        {
            if (i_start > i_end){
                if (j_start < j_end){
                    moves[i] = "UL";
                    j_start -= 1;
                    i_start -= 2;
                }
                else{
                    moves[i] = "UR";
                    j_start += 1;
                    i_start -= 2;
                }
            }
            else if (j_start < j_end){
                if (j_start < j_end){
                    moves[i] = "LL";
                    j_start -= 1;
                    i_start += 2;
                }
                else{
                    moves[i] = "LR";
                    j_start += 1;
                    i_start += 2;
                }
                    
            }
            else
            {
                if (j_start < j_end){
                    moves[i] = "L";
                    i_start -= 2;
                }
                else{
                    moves[i] = "R";
                    i_start += 2;
                }
            }
            i++;
        }
        if (i > 9)
      */  System.out.printf("Impossible");
        /*else{
        System.out.printf("%d\n", i);
            for (String move : moves){
             System.out.printf("%s ", move);        
            }
        }*/
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int i_start = in.nextInt();
        int j_start = in.nextInt();
        int i_end = in.nextInt();
        int j_end = in.nextInt();
        printShortestPath(n, i_start, j_start, i_end, j_end);
        in.close();
    }
}