#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define INF 100010 #define PI acos(-1) typedef long long ll; typedef pair p_ii; int main() { int n; cin >> n; vector a(500); a[0] = 0; for (int i = 1; i <= n; i++)cin >> a[i]; int sum = 0; for (int i = 1; i <= n; i++)sum += a[i]; int p = 0, height; for (int i = 1; i < 200; i++) { if (p + 2 * i - 1 > sum) { height = i - 1; break; } p += 2 * i - 1; } for (int i = 1; i <= height; i++) { sum -= (a[i] < i) ? a[i] : i; } for (int i = height + 1; i < 2 * height; i++) { sum -= (a[i] < 2 * height - i) ? a[i] : 2 * height - i; } cout << sum << endl; return 0; }