#include <bits/stdc++.h>
using namespace std;
int n, nAns;
int dfsA[10];
int e_x1[11], e_x2[11], _k[11], e_x3[11];
void dfs(int x) {
  if (dfsA[x] == n && x == nAns) {
    cout << nAns << endl;
    for (int i = 0; i < nAns; i++) {
      if (~e_x2[i])
        cout << "lea e" << char(e_x1[i] + 'a') << "x, [e" << char(e_x2[i] + 'a')
             << "x + " << _k[i] << "*e" << char(e_x3[i] + 'a') << "x]" << endl;
      else
        cout << "lea e" << char(e_x1[i] + 'a') << "x, [" << _k[i] << "*e"
             << char(e_x3[i] + 'a') << "x]" << endl;
    }
    exit(EXIT_SUCCESS);
  }
  if (x != nAns) {
    for (int i = 0; i <= x; i++) {
      for (int j = -1; j <= x; j++) {
        for (int k = 1; k < 9; k *= 2) {
          dfsA[x + 1] = dfsA[i] * k;
          if (j != -1) dfsA[x + 1] += dfsA[j];
          e_x1[x] = x + 1;
          e_x2[x] = j;
          _k[x] = k;
          e_x3[x] = i;
          dfs(x + 1);
        }
      }
    }
  }
}
int main() {
  cin >> n;
  dfsA[0] = 1;
  for (nAns = 0; nAns <= n; nAns++) dfs(0);
  return 0;
}
