#include<cstdio>  
#include<cstring>  
#include<algorithm>  
#include<iostream>  
#include<string>  
#include<vector>  
#include<stack>  
#include<bitset>  
#include<cstdlib>  
#include<cmath>  
#include<set>  
#include<list>  
#include<deque>  
#include<map>  
#include<queue>
using namespace std;
typedef long long ll;
const ll inf=1<<29;
const ll Maxn=1e6;

int a[10];

int main(){
	int ans=0,anw=0;
	cin>>a[1]>>a[2]>>a[3];
	sort(a+1,a+1+3);
	for(int i=1;i<=3;i++){
		if(a[i]%2==0) break;
		if(a[i]%2==1) ans++;
	}
	if(ans<3) printf("0\n");
	if(ans==3) printf("%d",a[1]*a[2]);
}

