#!/bin/python3

import sys

def printShortestPath(n, i1, j1, i2, j2):
    if(abs(i1-i2)%2!=0):
        print("Impossible")
    else:
        count = abs(i1-i2)
        if(count%2==0):
            if count == 0 and (j1==j2 or abs(j1-j2)%2!=0):
                print("Impossible")
            
                
        elif count%2 == 1 and abs(j1-j2)%2!= 1:
            print("Impossible")
            

if __name__ == "__main__":
    n = int(input().strip())
    i_start, j_start, i_end, j_end = input().strip().split(' ')
    i_start, j_start, i_end, j_end = [int(i_start), int(j_start), int(i_end), int(j_end)]
    printShortestPath(n, i_start, j_start, i_end, j_end)