#include <bits/stdc++.h>
#pragma GCC optimize(2, 3, "Ofast", "unroll-loops")
using namespace std;
namespace fast_io {
char buf[1 << 12], *p1 = buf, *p2 = buf, sr[1 << 23], z[23], nc;
int C = -1, Z = 0, Bi = 0, ny;
inline char gc() {
  return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 12, stdin), p1 == p2)
             ? EOF
             : *p1++;
}
inline long long read() {
  long long x = 0;
  ny = 1;
  while (nc = gc(), (nc < 48 || nc > 57) && nc != EOF)
    if (nc == 45) ny = -1;
  Bi = 1;
  if (nc < 0) return nc;
  x = nc - 48;
  while (nc = gc(), 47 < nc && nc < 58 && nc != EOF)
    x = (x << 3) + (x << 1) + (nc ^ 48), Bi++;
  return x * ny;
}
inline double gf() {
  int a = read(), y = ny, b = (nc != '.') ? 0 : read();
  return (b ? a + (double)b / pow(10, Bi) * y : a);
}
inline int gs(char *s) {
  char c, *t = s;
  while (c = gc(), c <= 32)
    ;
  *s++ = c;
  while (c = gc(), c > 32) *s++ = c;
  return s - t;
}
inline void ot() {
  fwrite(sr, 1, C + 1, stdout);
  C = -1;
}
inline void flush() {
  if (C > 1 << 22) ot();
}
template <typename T>
inline void write(T x, char t) {
  int y = 0;
  if (x < 0) y = 1, x = -x;
  while (z[++Z] = x % 10 + 48, x /= 10)
    ;
  if (y) z[++Z] = '-';
  while (sr[++C] = z[Z], --Z)
    ;
  sr[++C] = t;
  flush();
}
inline void write(char *s) {
  int l = strlen(s);
  for (int i = 0; i < l; i++) sr[++C] = *s++;
  sr[++C] = '\n';
  flush();
}
}  // namespace fast_io
using namespace fast_io;
const int N = 8, p = 1e9 + 7;
int n, tot, ans, a[N][N], b[N][1 << N];
vector<pair<vector<int>, int> > v;
map<vector<int>, int> mp;
vector<int> st;
inline void M(int &x) {
  x -= p;
  x += x >> 31 & p;
}
inline int qpow(int a, int b) {
  int c = 1;
  for (; b; b >>= 1, a = 1ll * a * a % p)
    if (b & 1) c = 1ll * a * c % p;
  return c;
}
int main() {
  n = read(), tot = 1 << n, v.push_back({vector<int>({0}), 1});
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++) a[i][j] = 1ll * read() * qpow(100, p - 2) % p;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < tot; j++) {
      b[i][j] = 1;
      for (int k = 0; k < n; k++)
        b[i][j] =
            1ll * b[i][j] * ((j & (1 << k)) ? a[i][k] : p + 1 - a[i][k]) % p;
    }
  for (int i = 0; i < n; i++) {
    mp.clear();
    for (int s = 0; s < tot; s++)
      for (pair<vector<int>, int> e : v) {
        vector<int> nt = e.first;
        int o = e.second;
        st.clear();
        for (int t : nt)
          for (int j = 0; j < n; j++)
            if (s & (1 << j) && !(t & (1 << j))) st.push_back(t | (1 << j));
        sort(st.begin(), st.end());
        st.resize(unique(st.begin(), st.end()) - st.begin());
        if (st.size()) M(mp[st] += 1ll * o * b[i][s] % p);
      }
    v.clear();
    for (pair<vector<int>, int> e : mp) v.push_back(e);
  }
  for (pair<vector<int>, int> e : v) M(ans += e.second);
  write(ans, '\n');
  return ot(), 0;
}
