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 is, int js, int ie, int je) {
        //  Print the distance along with the sequence of moves.\
        /*int count=0;
        while(is!=ie && js!=je && is+2<n && js+2<n){
        if(is==ie && js>je){
            count++;
            js+=2;
            System.out.print("R ");
        }
            if(is==ie && js<je){
                count++;
                js-=2;
                System.out.print("L ");
            }
            
            if(ie<is && je<js){
                count++;
                js-=1;
                is-=2;
                   System.out.print("UL ");
            }
            if(ie>is && je<js){
                count++;
                js-=1;
                is+=2;
                   System.out.print("LL ");
            }
            if(ie<is && je>js){
                count++;
                js+=1;
                is-=2;
                   System.out.print("UR ");
            }
            if(ie>is && je>js){
                count++;
                js+=1;
                is+=2;
                   System.out.print("LR ");
            }
           
            
        }
        
        if(count==0){
            System.out.println("Impossible");
        }
        else
            System.out.println(count);*/
        System.out.println("Impossible");
        
     
    }

    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();
    }
}