#include <bits/stdc++.h>
using namespace std;
const long long maxn = 3e5 + 10;
long long n, a[maxn], ans;
long long ansA[maxn], ansB[maxn];
long long ex_gcd(long long A, long long B, long long &x, long long &y) {
  if (B == 0) {
    x = 1;
    y = 0;
    return A;
  }
  long long re = ex_gcd(B, A % B, y, x);
  y -= x * (A / B);
  return re;
}
signed main() {
  cin >> n;
  if (n == 1) {
    cin >> a[1];
    cout << "1 1" << endl;
    cout << -a[1] << endl;
    cout << "1 1" << endl;
    cout << "0" << endl;
    cout << "1 1" << endl;
    cout << "0" << endl;
    return 0;
  }
  for (long long i = 1; i <= n; i++) scanf("%lld", &a[i]);
  cout << "1 1" << endl;
  cout << -a[1] << endl;
  long long A = n - 1, B = n;
  for (long long i = 2; i <= n; i++) {
    long long x = 0, y = 0;
    long long gcd = ex_gcd(A, B, x, y);
    ansA[i] = -x * a[i] * A;
    ansB[i] = -y * a[i] * B;
  }
  cout << "2 " << n << endl;
  for (long long i = 2; i <= n; i++) cout << ansA[i] << " ";
  cout << endl;
  cout << "1 " << n << endl;
  cout << "0 ";
  for (long long i = 2; i <= n; i++) cout << ansB[i] << " ";
  cout << endl;
  return 0;
}
