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) {
        //  Print the distance along with the sequence of moves.
        ArrayList<String> moves = new ArrayList<>();
        if (Math.abs(i_start - i_end)%2 != 0) {
            System.out.println("Impossible");
            return;
        }
        if (Math.abs(i_start - i_end)%2 != 1 && (Math.abs(j_start - j_end)%2 != 0)) {
            System.out.println("Impossible");
            return;
        }
        if (Math.abs(i_start - i_end)%2 != 0 && (Math.abs(j_start - j_end)%2 != 1)) {
            System.out.println("Impossible");
            return;
        }
        int count = 0;
        //while ()
    }

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