#include <bits/stdc++.h>

using namespace std;

int n, a[100005], last, tmp;

long long ans;

int main() {
	cin >> n;
	last = n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	} 
	sort(a + 1, a + n + 1, greater<int>());
	for (int i = 1; i <= n; i++) {
		ans += a[i];
		cout << a[i] << " ";
		tmp = last;
		for (int j = i + 1; j <= last; j++) {
			a[j] = floor(sqrt(a[j]));
			if (a[j] == 1) tmp = j;
		}
		last = tmp;
	}
	cout << "\n" << ans;
	return 0;
}