#include <iostream>
#include <vector>
#include <cmath>
#include <cstdio>
using namespace std;
/*double p[10],q[10];
double a[100][100];
void simplex(int n,int m){
	int i,j,k,cnt = 0;
	while(1){
		cout << cnt << endl;
		cnt++;
		double z = 0; int y = -1;
		for(i=0;i<m - 1;i++){
			if(a[n - 1][i]<z){
				z = a[n - 1][i];
				y = i;
				break;
			}
		}
		if(z>=0) break;
		int x = -1; double mn = 1000000000;
		for(i=0;i<n - 1;i++){
			if(a[i][y]>0 && a[i][m - 1]/a[i][y] < mn){
				mn = a[i][m - 1]/a[i][y];
				x = i;
			}
		}
		double p = a[x][y];
		for(i=0;i<m;i++){
			a[x][i] /= p;
		}
		for(i=0;i<n;i++){
			if(i==x) continue;
			p = a[i][y];
			for(j=0;j<m;j++){
				a[i][j] -= p*a[x][j];
			}
		}
	}
}*/
typedef vector<double> array;
typedef vector<array> matrix;
const double EPS = 1e-8;
enum { OPTIMAL, UNBOUNDED, NOSOLUTION, UNKNOWN };
struct two_stage_simplex {
  int N, M, st;
  matrix a;
  vector<int> s;
  two_stage_simplex(const matrix &A, const array &b, const array &c)
    : N(A.size()), M(A[0].size()), a(N+2, array(M+N+1)), s(N+2), st(UNKNOWN) {
    for (int j = 0; j < M; ++j) a[N+1][j] = c[j]; // make simplex table
    for (int i = 0; i < N; ++i)
      for (int j = 0; j < M; ++j) a[i+1][j] = A[i][j];
    for (int i = 0; i < N; ++i) a[i+1][M+N] = b[i]; // add helper table
    for (int i = 0; i < N; ++i) a[ 0 ][i+M] = 1;
    for (int i = 0; i < N; ++i) a[i+1][i+M] = 1;
    for (int i = 0; i < N; ++i) s[i+1]      = i+M;
    for (int i = 1; i <= N; ++i)
      for (int j = 0; j <= N+M; ++j) a[0][j] += a[i][j];
    st = solve();
  }
  int status() const { return st; }
  double solution() const { return -a[0][M]; }
  double solution(array &x) const {
    x.resize(M, 0);
    for (int i = 0; i < N; ++i)
      x[s[i+1]] = a[i+1].back();
    return -a[0][M];
  }
  int solve() {
    M += N; N += 1;
    solve_sub(); // solve stage one
    if (solution() > EPS) return NOSOLUTION;
    N -= 1; M -= N;
    swap(a[0], a.back()); a.pop_back(); // modify table
    for (int i = 0; i <= N; ++i) {
      swap(a[i][M], a[i].back());
      a[i].resize(M+1);
    }
    return solve_sub(); // solve stage two
  }
  int solve_sub() {
    int p, q;
    while (1) {
      //print();
      for (q = 0; q <= M && a[0][q] >= -EPS; ++q);
      for (p = 0; p <= N && a[p][q] <=  EPS; ++p);
      if (q >= M || p > N) break;
      for (int i = p+1; i <= N; ++i) // bland's care for cyclation
        if (a[i][q] > EPS)
          if (a[i][M]/a[i][q] < a[p][M]/a[p][q] ||
             (a[i][M]/a[i][q] == a[p][M]/a[p][q] && s[i] < s[q])) p = i;
      pivot(p, q);
    }
    if (q >= M) return OPTIMAL;
    else        return UNBOUNDED;
  }
  void pivot(int p, int q) {
    for (int j = 0; j <= N; ++j)
      for (int k = M; k >= 0; --k)
        if (j != p && k != q)
          a[j][k] -= a[p][k]*a[j][q]/a[p][q];
    for (int j = 0; j <= N; ++j)
      if (j != p) a[j][q] = 0;
    for (int k = 0; k <= M; ++k)
      if (k != q) a[p][k] = a[p][k]/a[p][q];
    a[p][q] = 1.0;
    s[p] = q;
  }
};
double p[10],q[10];
int main(){
	cout.precision(20);
	int i,j,n,m;
	for(i=0;i<6;i++){
		cin >> p[i]; p[i] /= 100;
	}
	for(i=0;i<6;i++){
		cin >> q[i]; q[i] /= 100;
	}
	n = 7,m = 12;
	matrix A(n,array(m));
	for(i=0;i<6;i++){
		A[0][i] = p[i] + q[i];
	}
	for(i=1;i<7;i++){
		A[i][i - 1] = 1; A[i][i + 5] = 1;
	}
	array b(n); array c(m);
	for(i=0;i<n;i++){
		b[i] = 1;
	}
	for(i=0;i<6;i++){
		c[i] = -p[i];
	}
	two_stage_simplex tss(A,b,c);
	double ans = -tss.solution();
	cout << ans << endl;	
}

Measured memory_bytes: 256