Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

var sc = bufio.NewScanner(os.Stdin)

//Sliceconvtof ...
func Sliceconvtof() []float64 {
	strs := strings.Split(sc.Text(), " ")

	var flts []float64
	var x int

	for _, s := range strs {
		x, _ = strconv.Atoi(s)
		xf := float64(x)
		flts = append(flts, xf)
	}

	return flts
}

func main() {

	for sc.Scan() {
		i := Sliceconvtof()
		fmt.Printf("%6f", i[0]*i[1]/3.305785)
	}

}

C++: #include<stdio.h>
int main()
{
int x,y;
double w;
scanf("%d",&x);scanf("%d",&y);
w=(x/y)/3.305785;
printf("%.6lf\n");
return 0;
}

C++: #define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
using namespace std;
#ifndef FAST_IO
 #define IOS ios_base::sync_with_stdio(false);cin.tie(nullptr);
#endif

#define int long long
#define FILE_IO freopen("input.txt","r",stdin)/#define int long long
#define f first
#define s second
#define endl '\n'
#define all(c) c.begin(),c.end()
#define bp __builtin_popcount
#define debug(x) cerr << #x << " = " << x << endl;

const int MOD = 1e9 + 7;
const int INF = 1000000000;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T>void print(T t){for(auto &it : t)cout<<it<<" ";}
inline int powerexp(int a, int b, int m = MOD){ int res = 1;while(b){if(b&1)res = res * a % m;a = a * a % m,b >>= 1;}return res % m;}
inline int modinv(int a){ return powerexp(a,MOD-2,MOD);}
inline int lcm(int a, int b){ int g = __gcd(a,b);return a/g*b;}
inline int add(int x, int y){ x += y; if (x >= MOD) x -=  MOD; return x;}
inline int mul(int x, int y){ return (x * 1ll * y) % MOD;}
inline int sub(int x, int y){ x -= y; if (x<0) x += MOD; return x ;}

//-------------------< start here >-------------------------// 

void solve(){
  cout << fixed;
  cout << setprecision(12);
  
  double a, b;
  cin >> a >> b;
  double ret = a * b;
  ret /= 3.305785;
  cout << ret << endl; 
}

//-----------------------------
//comment from here for TOPCODER 
int32_t main(){
   IOS;
   solve();
   //find();
   #ifdef LOCAL_DEFINE
   cerr << "time elapsed " << (double)clock()/CLOCKS_PER_SEC << endl;
   #endif
}

C++: #include<iostream>
#include<iomanip>
using namespace std;
int main(){
  double a,b;
  cin >> a >> b;
  cout << fixed << setprecision(4) << a * b / 3.305785 << endl;
  return 0;
}

C++: #include <iostream>
#include <iomanip>
using namespace std;

int main(){
  double a,b;
  while(cin>>a>>b) cout<<fixed<<setprecision(6)<<a*b/3.305785<<endl;
  return 0;
}

C++: #include <cstdio>
#include <cstdlib>
using namespace std;

const static double TSUBO_METER = 3.305785;
int main() {
  int a, b;

  scanf( "%d%d", &a, &b );
  printf( "%.7f\n", a * b / TSUBO_METER );

  return EXIT_SUCCESS;
}

C++: #include <iostream>
#include <cstdio>
using namespace std;
int main(){
	double a,b,c=3.305785,tubo;
	cin>>a>>b;
	tubo=(a*b)/c;
	printf("%.6lf\n",tubo);
	return 0;
}

C++: #include<cstdio>
#include<string>
#include<algorithm>
using namespace std;

#define rep(i,n) for(int i=0; i<n; i++)

int main(){
    int a, b;
    scanf("%d %d", &a, &b);
    double S = 1. * a * b / 3.305785;
    printf("%.6lf\n", S);
    return 0;
}

C++: #include<iostream>
int main(){
	int a,b;
	std::cin >> a >> b;
	std::cout << ((double)a*b) / 3.305785 << std::endl;
}

C++: //-------------
//include
//-------------
#include <map>
#include <list>
#include <cmath>
#include <vector>
#include <string>
#include <cctype>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
//-------------
//typedef
//-------------
typedef  long long LL;
typedef  vector<int> VI;
typedef  vector<double> VD;
typedef  string STR;
typedef  pair<int, int> PII;
typedef  vector<int, int> VII;
typedef  map<string, int> MSI;
//-------------
//utillty
//-------------
#define ALL(a)  (a).begin(),(a).end()
#define MK make_pair
#define PB push_back
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define COUT(a) cout<<a<<endl
#define POW2(a) pow(a, 2.0)
//-------------
//repetition
//-------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
//-------------
//debug
//-------------
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define dumpl(c) REP(i,SZ(c))cerr<<#c<<i<<"="<<(c[i])<<endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

const int MOD = 1000000007;
int main()
{
	long double a, b;
	long double c = 3.305785;
	cin >> a >> b;
	printf("%lf\n", (a*b)/c);
#ifdef _DEBUG
	while(1);
#endif // _DEBUG

	return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <vector>
#include <list>
#include <cmath>
#include <fstream>
#include <algorithm>
#include <string>
#include <queue>
#include <set>
#include <map>
#include <complex>
#include <iterator>
#include <cstdlib>
#include <cstring>
#include <sstream>
#include <stack>
#include <climits>
#include <deque>
#include <bitset>
#include <cassert>
#include <ctime>
using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
const int dy[]={-1,0,1,0},dx[]={0,1,0,-1};
// adjust problem by problem
const double EPS=1e-8;
const double PI=acos(-1.0);
#ifdef __GNUC__
int popcount(int n){return __builtin_popcount(n);}
int popcount(ll n){return __builtin_popcountll(n);}
#endif
#ifndef __GNUC__
template<class T> int popcount(T n){int cnt=0;while(n){if(n%2)cnt++;n/=2;}return cnt;}
#endif
template<class T>int SIZE(T a){return a.size();}
template<class T>string IntToString(T num){string res;stringstream ss;ss<<num;return ss.str();}
template<class T>T StringToInt(string str){T res=0;for(int i=0;i<SIZE(str);i++)res=(res*10+str[i]-'0');return res;}
template<class T>T gcd(T a,T b){if(b==0)return a;return gcd(b,a%b);}
template<class T>T lcm(T a,T b){return a/gcd(a,b)*b;}
template<class T> void PrintSeq(T &a,int sz){for(int i=0;i<sz;i++){cout<<a[i];if(sz==i+1)cout<<endl;else cout<<' ';}}
bool EQ(double a,double b){return abs(a-b)<EPS;}
void fastStream(){cin.tie(0);std::ios_base::sync_with_stdio(0);}
vector<string> split(string str,char del){
  vector<string> res;
  for(int i=0,s=0;i<SIZE(str);i++){
    if(str[i]==del){if(i-s!=0)res.push_back(str.substr(s,i-s));s=i+1;}
    else if(i==SIZE(str)-1){res.push_back(str.substr(s));}
  }
  return res;
}

int main(){

  double a,b;
  cin>>a>>b;
  printf("%.10f\n",a*b/3.305785);
  
  return 0;
}

C++: #include <iostream>
using namespace std;

int main()
{
	double a, b;
	cin >> a >> b;
	cout << a * b / 3.305785 << endl;
	
	return 0;
}

C++: #include<iostream>
#include<cstdio>

using namespace std;

int Month;
int Day;

char *data[] ={
 "Monday",
 "Tuesday",
 "Wednesday",
 "Thursday",
 "Friday",
 "Saturday",
 "Sunday"
};
int days[12] = {31,29,31,30,31,30,31,31,30,31,30,31};

int ans[12][31];
int d;
int main()
{   
    
  scanf("%d %d",&d,&Month);
  double a = d*Month/3.305785;
  cout <<a;
  return 0;
}

C++: #include <cstdio>

using namespace std;

double a, b;
const double P = 3.305785;
int main() {
    while (scanf("%lf %lf", &a, &b) == 2) {
        printf("%.6f\n", (a * b / P));
    }
    return 0;
}

C++: #include<iostream>
#include<cstdio>
using namespace std;

int main(){

	int a, b;
	
	cin >> a >> b;
	
	printf("%.6f\n", a * b / 3.305785);

	return 0;

}

C++: #include<cstdio>
using namespace std;
int main(void){
  double a,b;
  scanf("%lf %lf",&a,&b);
  printf("%.6f\n",(a*b)/3.305785);
}

C++: #include <cstdio>

using namespace std;

int main(){ int a,b; scanf("%d%d",&a,&b); printf("%f\n",a*b/3.305785); return 0; }

C++: #include <cstdio>
using namespace std;

int main(){
  double a, b;
  scanf("%lf%lf",&a,&b);

  printf("%.6f\n",a*b/3.305785);

  return 0;
}

C++: #include <iostream>
#include <cstdio>
using namespace std;

int main() {
  int a, b;
  double c;
  cin >> a >> b;
  c = a*b/3.305785;
  printf("%.4lf", c);
  cout << "h";
  return 0;
}