#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<utility>
#include<sstream>
#include<cctype>
#include<cmath>
#include<algorithm>
using namespace std;

#define ALL(x) (x).begin(),(x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define rev(i,n) for(int (i)=(n-1);(i)>=0;(i)--)
#define repp(i,n) for(int (i)=1;(i)<=(n);(i)++)
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rev(i,n) for(int (i)=(n-1);(i)>=0;(i)--)
#define clr(a) memset((a), 0 ,sizeof(a))


typedef pair<int,int> P;
typedef vector<pair<int,string> > pii;
typedef map<string,int> mi;

int main(){
	int sai[]={2,3,5,7,11,13};
	int sai2[]={4,6,8,9,10,12};
	double a,b,x=0,y=0,sum;
	cin >> a >> b;
	for(int i=0;i<6;i++){
		x+=sai[i];
		y+=sai2[i];
	}
	x/=6;
	y/=6;
	sum=pow(x,a)*pow(y,b);
	printf("%.10lf\n",sum);
	return 0;
}