#include using namespace std; #define INF 2000000000 #define MOD 1000000007 typedef long long ll; typedef pair P; int main() { int n; cin >> n; int a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; } ll sum = accumulate(a, a+n, 0); int ret = 0; int tmp; for (int i = 1; i < 20; i++) { tmp = i*i; if (tmp>sum) { tmp = (i-1)*(i-1); break; } } int leng = sqrt(tmp); cout << leng << "\n"; int expect = 0; for (int i = 0; i < n; i++) { if (leng<(i+1)) { expect--; } else { expect++; } // cout << "d_: " << expect << " " << a[i] << endl; if (a[i]==expect) { continue; } else { ret += abs(a[i]-expect); } } cout << ret << endl; }