/* program p5_04_AC 《聪明人的游戏提高篇》 1307：【例1.3】高精度乘法

#include <bits/stdc++.h>
using namespace std;
const int maxL=200;
string s;
int lena,lenb,lenc;
int a[maxL],b[maxL],c[maxL];
void multiply(int a[],int lenax,int b[],int lenbx,int c[],int& lencx)
{
	memset(c,0,sizeof(c));
	
	lencx=lenax+lenbx;
	
	for(int i=0;i<lenax;++i)
	for(int j=0;j<lenbx;++j)
	{
		int w=i+j;
		c[w]+=a[i]*b[j];
		c[w+1]+=c[w]/10; 
		//cout<<"w1="<<w<<" "<<c[w]<<" "<<c[w+1]<<" "<<w+1<<endl;
		c[w]%=10;
		//cout<<"w2="<<w<<" "<<c[w]<<endl;
		//cout<<"----------------------------"<<endl;
	}
	
	while( lencx>1 && c[lencx-1] == 0 )	--lencx;
}
int main()
{
	cin>>s;
	lena=s.length();
	
	for(int i=0;i<lena;++i)
	{
		a[i]=s[lena-1-i]-'0';
	}
	
	cin>>s;
	lenb=s.length();
	for(int i=0;i<lenb;++i)
	{
		b[i]=s[lenb-1-i]-'0';
	}
	
	multiply(a,lena,b,lenb,c,lenc);
	
	for(int i=lenc-1;i>=0;--i)
	{
		cout<<c[i];
	}
	cout<<endl;
	
	return 0;
}