#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (1e+18) + 7;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-6;
const ld pi = acos(-1.0);
//typedef vector<vector<ll>> mat;
typedef vector<int> vec;

void debug(vector<int> &v) {
	rep(i, v.size()) {
		if (i > 0)cout << " ";
		cout << v[i];
	}
	cout << endl;
}

ll mod_pow(ll a, ll n,ll m=mod) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * a%m;
		a = a * a%m; n >>= 1;
	}
	return res;
}

struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n%mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
	if (n == 0)return modint(1);
	modint res = (a*a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1<<18;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}

struct uf {
private:
	vector<int> par, ran;
public:
	uf(int n) {
		par.resize(n, 0);
		ran.resize(n, 0);
		rep(i, n) {
			par[i] = i;
		}
	}
	int find(int x) {
		if (par[x] == x)return x;
		else return par[x] = find(par[x]);
	}
	void unite(int x, int y) {
		x = find(x), y = find(y);
		if (x == y)return;
		if (ran[x] < ran[y]) {
			par[x] = y;
		}
		else {
			par[y] = x;
			if (ran[x] == ran[y])ran[x]++;
		}
	}
	bool same(int x, int y) {
		return find(x) == find(y);
	}
};
int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };

//Vnからr個の基底をとる
modint calc_comb(int n, int r) {
	modint res = 1;
	rep(i, r) {
		modint c = mod_pow(2, n) - mod_pow(2, i);
		res = res * c;
	}
	return res;
}
//Vnから次元rの部分空間を取る
modint calc_s(int n,int r) {
	return calc_comb(n, r) / calc_comb(r, r);
}
//Vn->Vr全射準同型の個数
modint calc_smp(int n,int r) {
	return calc_comb(r, r)*calc_s(n,n-r);
}


int Gaussian_elimination(vector<vector<int>> &A) {
	int n = A.size(); int m = A[0].size();
	int le = 0;
	rep(j, m) {
		Rep(i, le, n) {
			if (A[i][j]) {
				swap(A[le], A[i]);
				Rep(i2, le + 1, n) {
					if (A[i2][j]) {
						rep(k, m) {
							A[i2][k] ^= A[le][k];
						}
					}
				}
				le++; break;
			}
		}
	}
	return le;
}

void solve() {
	int n; cin >> n;
	vector<vector<int>> b(n);
	rep(i, n) {
		b[i].resize(n);
		rep(j, n) {
			int t; cin >> t;
			b[i][j] = t;
		}
	}

	int r = Gaussian_elimination(b);

	

	//次元rの行列の数
	modint ca = calc_s(n, r)*calc_smp(n,r);

	//A*Bが次元rになる
	modint cb = 0;
	for (int db = r; db <= n; db++) {
		//dimB=db
		modint rb = calc_smp(n, db)*calc_s(n, db);

		modint ext = mod_pow(mod_pow(2, n), n - db);
		modint ra = calc_s(n, r)*calc_smp(db,r)*ext;
		cb += ra * rb;
	}
	//cout << cb << " " << ca << endl;
	modint ans = cb / ca;
	cout << ans << endl;
}


signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	init_f(); //init();
	//init();
	//int t; cin >> t; rep(i, t)solve();
	//while(cin>>w>>h,w)solve();
	solve();
	stop
		return 0;
}

Measured memory_bytes: 4736