#!/bin/python3

import sys
_dic = {"UL":[-1, 2], "UR": [1, 2], "R": [0, 2], "LR": [1, -2], "LL": [-1, -2]}

def printShortestPath(n, i_start, j_start, i_end, j_end):
  if (abs(i_end - i_start) % 2) == 1:
    print ("Impossible")
    return
  

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)