#include <bits/stdc++.h>
using namespace std;
bool isPalindrome(string s) {
  int n = s.length();
  for (int i = 0; i < n / 2; i++) {
    if (s[i] != s[n - i - 1]) {
      return false;
    }
  }
  return true;
}
template <typename T, typename U>
T max_self(T a, U b) {
  if (b > a) {
    a = b;
  }
  return a;
}
template <typename T, typename U>
T min_self(T a, U b) {
  if (b < a) {
    a = b;
  }
  return a;
}
void solve() {
  long long n;
  cin >> n;
  long long arr[n];
  for (int i = (0); i < (n); i += 1) {
    cin >> arr[i];
  }
  if (n == 1) {
    cout << "1 1\n" << -arr[0] << "\n1 1\n0\n1 1\n0\n";
    return;
  }
  if (arr[0] == 0) {
    cout << "1 1\n" << n << "\n";
    arr[0] = n;
  } else {
    long long t = (n - 1) * arr[0];
    cout << "1 1\n" << t << "\n";
    arr[0] += t;
  }
  cout << 2 << " " << n << "\n";
  for (int i = (1); i < (n); i += 1) {
    long long t = arr[i];
    if (t == 0) {
      t = n;
      arr[i] = t;
      cout << t << " ";
      continue;
    }
    long long x = (n - 1) * t;
    cout << x << " ";
    arr[i] += x;
  }
  cout << "\n" << 1 << " " << n << "\n";
  for (int i = (0); i < (n); i += 1) {
    cout << -arr[i] << " ";
  }
  cout << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int tt = 1;
  while (tt--) {
    solve();
  }
  return 0;
}
