#include <bits/stdc++.h>
using namespace std;
bool cando(long long mid, vector<long long> pref, long long s) {
  long long n = pref.size() - 1;
  for (long long i = 1; i <= n; i++) {
    if (i + mid - 1 > n) return false;
    long long prefsum = pref[i + mid - 1] - pref[i - 1];
    long long sum = (i + mid - 1) * (i + mid) / 2 - (i - 1) * (i) / 2;
    if (prefsum + sum * mid <= s) return true;
  }
  return false;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long T = 1;
  while (T--) {
    long long n;
    cin >> n;
    vector<long long> arr(n);
    for (long long i = 0; i < n; i++) cin >> arr[i];
    if (n == 1) {
      cout << 1 << " " << 1 << '\n';
      cout << n - arr[0] << '\n';
      cout << 1 << " " << 1 << '\n';
      cout << 0 << '\n';
      cout << 1 << " " << 1 << '\n';
      cout << -1 * n << '\n';
      continue;
    }
    cout << 1 << " " << n - 1 << '\n';
    for (long long i = 0; i < n - 1; i++) {
      cout << arr[i] * (n - 1) << " ";
      arr[i] += arr[i] * (n - 1);
    }
    cout << '\n';
    cout << n << " " << n << '\n';
    cout << (n - arr[n - 1]) << '\n';
    arr[n - 1] += n - arr[n - 1];
    cout << 1 << " " << n << '\n';
    for (long long i = 0; i < n; i++) cout << -1 * arr[i] << " ";
    cout << '\n';
  }
  return 0;
}
