#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef array<int, 3> ai3;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3fll;
const int Mod = 1e9 + 7;
inline int sign(int a){ return (a&1) ? (Mod-1) : 1; }
inline void uadd(int &a, int b){ a += b-Mod; a += (a>>31) & Mod; }
inline void usub(int &a, int b){ a -= b, a += (a>>31) & Mod; }
inline void umul(int &a, int b){ a = (int)(1ll * a * b % Mod); }
inline int add(int a, int b){ a += b-Mod; a += (a>>31) & Mod; return a; }
inline int sub(int a, int b){ a -= b, a += (a>>31) & Mod; return a; }
inline int mul(int a, int b){ a = (int)(1ll * a * b % Mod); return a; }
int qpow(int b, ll p){ int ret = 1; while(p){ if(p&1) umul(ret, b); umul(b, b), p >>= 1; } return ret; }
const int fN = 111;
int fact[fN], invfact[fN], pw2[fN], invpw2[fN], inv[fN];
void initfact(int n){
	pw2[0] = 1; for(int i = 1; i <= n; ++i) pw2[i] = mul(pw2[i-1], 2);
	invpw2[0] = 1; for(int i = 1; i <= n; ++i) invpw2[i] = mul(invpw2[i-1], (Mod+1) / 2);
	fact[0] = 1; for(int i = 1; i <= n; ++i) fact[i] = mul(fact[i-1], i);
	invfact[n] = qpow(fact[n], Mod-2); for(int i = n; i > 0; --i) invfact[i-1] = mul(invfact[i], i);
	for(int i = 1; i <= n; ++i) inv[i] = mul(invfact[i], fact[i-1]);
}
int binom(int n, int m){ return (m < 0 || m > n) ? 0 : mul(fact[n], mul(invfact[m], invfact[n-m])); }
const double pi = acos(-1);
inline void chmax(int &a, int b){ (b>a) ? (a=b) : 0; }
inline void chmin(int &a, int b){ (b<a) ? (a=b) : 0; }

int n;
const int L = 360;
const int p8[] = {0, 45, 90, 135, 180, 225, 270, 315, 360};

typedef array<int, 2> ai2;

bool hor[7272], ver[7272];
inline int pack(ai2 p){ return p[0] * L + p[1]; }
inline ai2 unpack(int x){ return {x / L, x % L}; }

int nxt[366][7272], dis[366][7272];
int getnxt(int x, int u){
	if(nxt[x][u] >= 0) return nxt[x][u];
	ai2 p = unpack(u);
	int d = (p[1] - x + L) % L;
	bool canver = (d > p8[2] && d < p8[6] && ver[pack({p[0], p[1]})]);
	canver |= (p[0] && (d < p8[2] || d > p8[6]) && ver[pack({p[0] - 1, p[1]})]);
	bool canhor = d && ((d < p8[4] && hor[pack({p[0], p[1]})]) || (d > p8[4] && hor[pack({p[0], (p[1] + L - 1) % L})]));
	if(canver && canhor)
		(((d > p8[1] && d < p8[3]) || (d > p8[5] && d < p8[7])) ? canver : canhor) = 0;
	if(canver){
		nxt[x][u] = getnxt(x, (d > p8[2] && d < p8[6]) ? pack({p[0] + 1, p[1]}) : pack({p[0] - 1, p[1]}));
	} else if(canhor){
		nxt[x][u] = getnxt(x, (d < p8[4]) ? pack({p[0], (p[1] + 1) % L}) : pack({p[0], (p[1] + L - 1) % L}));
	} else {
		nxt[x][u] = u;
	}
	//cout << "nxt " << x << " " << u << "(" << p[0] << " " << d << ")" << " = " << nxt[x][u] << endl;
	return nxt[x][u];
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);

	cin >> n;
	rep(i, n){
		int K;
		cin >> K;
		while(K--){
			int l, r;
			cin >> l >> r;
			for(int j = l; j != r; j = (j+1) % L) hor[pack({i, j})] = 1;
		}
		cin >> K;
		while(K--){
			int x;
			cin >> x;
			ver[pack({i, x})] = 1;
		}
	}

	memset(nxt, -1, sizeof(nxt));

	ai2 S, T;
	cin >> S[0] >> S[1] >> T[0] >> T[1];
	S = unpack(getnxt(0, pack(S)));

	memset(dis, 0x3f, sizeof(dis));
	dis[0][pack(S)] = 0;
	queue< pii > q;
	q.push(make_pair(0, pack(S)));
	while(!q.empty()){
		int x = q.front().first, u = q.front().second; q.pop(); int d = dis[x][u];
		assert(nxt[x][u] == u);
		if(u == pack(T)){
			cout << d << "\n";
			return 0;
		}
		auto go = [&](int nx){
			int nu = getnxt(nx, u);
			if(d + 1 < dis[nx][nu])
				dis[nx][nu] = d + 1, q.push(make_pair(nx, nu));
		};
		go((x + 1) % L), go((x + L - 1) % L);
	}

	cout << "Impossible\n";

	return 0;
}