using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
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.
        // Impossible moves
        int max_i = i_start > i_end? i_start: i_end;
        int min_i = i_start < i_end? i_start: i_end;
        int max_j = j_start > j_end? j_start: j_end;
        int min_j = j_start < j_end? j_start: j_end;
        
        if((max_i-min_i)%2 != 0)
            Console.WriteLine("Impossible");
        
        
        
     
            
            
       
     
    }

    static void Main(String[] args) {
        int n = Convert.ToInt32(Console.ReadLine());
        string[] tokens_i_start = Console.ReadLine().Split(' ');
        int i_start = Convert.ToInt32(tokens_i_start[0]);
        int j_start = Convert.ToInt32(tokens_i_start[1]);
        int i_end = Convert.ToInt32(tokens_i_start[2]);
        int j_end = Convert.ToInt32(tokens_i_start[3]);
        printShortestPath(n, i_start, j_start, i_end, j_end);
    }
}