#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
double a, b, c;
vector<double> A; //弄一个vector来sort()排序,真省心
cin >> a >> b >> c;
A.push_back(a), A.push_back(b), A.push_back(c);
sort(A.begin(), A.end());
if (A[2] >= A[0] + A[1]) { //只要最长的边大于俩短边之和就无法组成三角形
printf("Area = %.1lf\n", (a + b) * c / 2.0);
} else {
printf("Perimetro = %.1lf\n", a + b + c);
}
return 0;
}