#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
int a[N];
long long ans[N];
int main() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  if (n == 1) {
    cout << 1 << ' ' << 1 << '\n';
    cout << 0 << '\n';
    cout << 1 << ' ' << 1 << '\n';
    cout << 0 << '\n';
    cout << 1 << ' ' << 1 << '\n';
    cout << -a[1] << '\n';
    return 0;
  }
  for (int i = 1; i <= n; i++) {
    long long x = a[i];
    long long yu = x % (n - 1);
    long long byu = (n - 1 - yu) * n;
    ans[i] = byu + a[i];
  }
  cout << 1 << ' ' << n << '\n';
  for (int i = 1; i <= n; i++) {
    cout << ans[i] - a[i] << ' ';
  }
  cout << '\n';
  cout << 1 << ' ' << 1 << '\n';
  cout << -ans[1] << '\n';
  cout << 2 << ' ' << n << '\n';
  for (int i = 2; i <= n; i++) {
    cout << -ans[i] << ' ';
  }
  return 0;
}
