#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>

using namespace std;

#define sz size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#define rep(i,a,b) for(int i=(a);i<(b);++i)
#define clr(a, b) memset((a), (b) ,sizeof(a))

#define MOD 1000000007

#define N 2

double a[N][N], b[N], x[N]; 

void gj(int n){
  int i, j, k;
  double w, m, s;

  for(k = 0; k < n-1; k++){
    w = 1.0 / a[k][k];
    for(i = k + 1; i < n; i++){
      m = a[i][k] * w;
      for(j = k + 1; j < n; j++){
        a[i][j] -= m * a[k][j];
      }
      b[i] -= m * b[k];
    }
  }

  x[n-1] = b[n-1] / a[n-1][n-1];

  for(k = n-2; k >= 0; k--){
    s = 0.0;
    for(j = k + 1; j < n; j++){
      s += a[k][j] * x[j];
    }
    x[k] = (b[k] - s) / a[k][k];
  }
}

int main() {
    int c,d;
    cin>>c>>d;
    a[0][0] = 21;
    a[0][1] = 8;
    a[1][0] = 7;
    a[1][1] = 20;
    b[0] = 28*c;
    b[1] = 28*d;
    double mx = 0.;
    mx = max(mx,min(2000.*28*c/8,2000.*28*d/20));
    mx = max(mx,min(1000.*28*c/21,1000.*28*d/7));
    gj(2);
    if(x[0]>=0&&x[1]>=0){
      mx = max(mx,1000.*x[0]+2000.*x[1]);
    }
    printf("%10.10f\n",mx);
    return 0;
}