#include <bits/stdc++.h>
using namespace std;
long long a[100010], a1[100010], a2[100010];
int main() {
  long long n, i;
  cin >> n;
  for (i = 1; i <= n; i++) cin >> a[i];
  if (n == 1) {
    printf("1 1\n0\n1 1\n0\n1 1\n%lld", -a[1]);
    return 0;
  }
  cout << 1 << ' ' << n << endl;
  for (i = 1; i <= n; i++) {
    a[i] += (n - 1) * 1000000000;
    a1[i] = a[i] - (n - 1) * 1000000000 + (n - 1 - (a[i] % (n - 1))) * n;
    cout << (n - 1 - (a[i] % (n - 1))) * n << ' ';
  }
  cout << endl << 1 << ' ' << n - 1 << endl;
  for (i = 1; i < n; i++) cout << 0 - a1[i] << ' ';
  cout << endl << n << ' ' << n << endl << 0 - a1[n];
}
