#include <iostream>
#include <cmath>
using namespace std;
int main() {
int a[12];
int count = 0;
int count_of_elements = 0;
int j = 0;
cin >> count;
for(size_t i = 0; i < count; i++)
{
int n = 0;
cin >> n;
(n > 9) ? n = 9 : (n < 5) ? n = 5 : n;
(n % 2 != 0) ? a[j] = n, count_of_elements++, j++ : n;
cout << n << " ";
}
cout << endl;
int answer = 1;
for(size_t i = 0; i < count_of_elements; i++)
{
answer *= a[i];
}
cout << pow(answer, 1 / double(count_of_elements)) << endl;
}
//Ввод: count - кол-во чисел в массиве, n - сами числа.