#include <bits/stdc++.h>
using namespace std;
int n, best;
string name[28];
struct reg {
  int a, b, c, val;
} ex[28];
void dfs(int x) {
  if (x == best) {
    if (ex[x].val == n) {
      cout << x - 1 << endl;
      for (int i = 2; i <= x; i++) {
        cout << "lea " << name[i] << ", [";
        if (ex[i].a) cout << name[ex[i].a] << " + ";
        if (ex[i].c) cout << ex[i].b << "*" << name[ex[i].c];
        cout << "]\n";
      }
      exit(0);
    }
    return;
  };
  x++;
  for (int i = 0; i < x; i++) {
    for (int j = 1; j < x; j++) {
      for (int k = 0; k < 4; k++) {
        ex[x].a = i;
        ex[x].b = 1 << k;
        ex[x].c = j;
        if ((ex[x].val = ex[i].val + (ex[j].val << k)) > n) continue;
        dfs(x);
      }
    }
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n;
  for (int i = 1; i <= 26; i++)
    name[i] = "e" + string(1, char('a' + i - 1)) + "x";
  ex[1].val = 1;
  for (best = 1;; best++) dfs(1);
  return 0;
}
