#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

int chk(int a, int b, int x, int y)
{
    int o=0;
    if(a%2)
    {
        if(x%2 == 0)
        {
            return 0;
        }
    }
    else if(a%2 == 0)
    {
        if(x%2)
        {
            return 0;
        }
    }
    else
    {
        int v = (x-a)/2;
        if(v%2)
        {
            //odd
            if(b%2 == 0)
            {
                o=1;
            }
        }
        else
        {
            //even
            if(b%2)
            {
                o=1;
            }
        }
        if(o)
        {
            if(y%2 == 0)
                return 0;
        }
        else
        {
            if(y%2)
                return 0;
        }
    }
    return 1;
}

int main() 
{
    int n;
    cin>>n;
    int m[n][n];
    for(int i=0;i<n;i++)
        for(int j=0;j<n;j++)
            m[i][j]=0;
    int a,b,x,y;
    cin>>a>>b>>x>>y;
    m[a][b] = 1;
    if(chk(a,b,x,y))
    {
        //find shortest path
    }
    else
    {
        cout<<"Impossible";
    }
    return 0;
}