#include <bits/stdc++.h>
using namespace std;
long long power(long long x, long long y);
long long mpower(long long x, long long y, long long p);
long long modInv(long long a, long long m);
long long gcdExtended(long long a, long long b, long long *x, long long *y);
bool isPrime(long long n);
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long i, j, k, c, aa, bb;
  long double t, l, h, p, q, r, x, y, z, a, b, d, f, n, m, M = 1000000007;
  char ch, ch2, ch3;
  string s, s1, s2, s3;
  vector<long long> v, w;
  unordered_map<long long, long long> N;
  set<long long> S;
  set<long long>::iterator itr;
  long long A[10][10], B[10][10], L[100];
  long double dp[101];
  for (i = 0; i < 10; i++) {
    for (j = 0; j < 10; j++) {
      cin >> A[i][j];
    }
  }
  c = 1;
  for (i = 9; i >= 0; i--) {
    if (i % 2) {
      for (j = 0; j <= 9; j++) {
        B[i][j] = c;
        c++;
      }
    } else {
      for (j = 9; j >= 0; j--) {
        B[i][j] = c;
        c++;
      }
    }
  }
  for (i = 0; i < 10; i++) {
    for (j = 0; j < 10; j++) {
      c = i;
      for (k = 0; k < A[i][j]; k++) {
        c--;
      }
      L[B[i][j]] = B[c][j];
    }
  }
  pair<long long, long long> X[101];
  dp[100] = 0;
  for (i = 99; i >= 95; i--) {
    x = 0;
    for (j = 1; j <= (100 - i); j++) {
      x += (1 + dp[i + j]) / 6;
    }
    p = i - 94;
    x = (p + (6 * x)) / (6 - p);
    dp[i] = x;
  }
  for (i = 94; i > 0; i--) {
    x = 0;
    for (j = 1; j <= 6; j++) {
      k = i + j;
      aa = X[k].first;
      bb = X[k].second;
      p = 1 + min(dp[k], dp[L[k]]);
      x += p / 6;
    }
    dp[i] = x;
  }
  cout << fixed << setprecision(10) << dp[1];
  return 0;
}
long long modInv(long long a, long long m) {
  long long x, y;
  long long g = gcdExtended(a, m, &x, &y);
  long long res = (x % m + m) % m;
  return res;
}
long long gcdExtended(long long a, long long b, long long *x, long long *y) {
  if (a == 0) {
    *x = 0, *y = 1;
    return b;
  }
  long long x1, y1;
  long long gcd = gcdExtended(b % a, a, &x1, &y1);
  *x = y1 - (b / a) * x1;
  *y = x1;
  return gcd;
}
long long mpower(long long x, long long y, long long p) {
  long long res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
long long power(long long x, long long y) {
  long long res = 1;
  while (y > 0) {
    if (y & 1) res = res * x;
    y = y >> 1;
    x = x * x;
  }
  return res;
}
bool isPrime(long long n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  long long p = sqrt(n);
  for (int i = 5; i <= p; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return false;
  return true;
}
