#!/bin/python

import sys
import Queue
def printShortestPath(n, i_start, j_start, i_end, j_end):
    #  Print the distance along with the sequence of moves.
    a=abs(i_start-i_end)
    b=abs(j_start-j_end)
    c= a/2
    if a%2!=0:
        print "Impossible"
    
    elif abs(b-c) %2 != 0:
        print "Impossible"
        
if __name__ == "__main__":
    n = int(raw_input().strip())
    i_start, j_start, i_end, j_end = raw_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)