#include <bits/stdc++.h>
using namespace std;
const int N = 27;
int reg[N], n, ans, ans1[N], ans2[N], bs[N];
int id[N];
bool flag;
const int prame[5] = {0, 1, 2, 4, 8};
int read() {
  int x = 0, f = 1;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    x = (x << 1) + (x << 3) + (c ^ 48);
    c = getchar();
  }
  return x * f;
}
void PrintAns() {
  cout << ans << endl;
  for (int i = 1; i <= ans; i++) {
    if (id[i] == 1) printf("lea e%cx, [e%cx]\n", i + 'a', ans1[i] + 'a');
    if (id[i] == 2)
      printf("lea e%cx, [e%cx + e%cx]\n", i + 'a', ans1[i] + 'a',
             ans2[i] + 'a');
    if (id[i] == 3)
      printf("lea e%cx, [%d*e%cx]\n", i + 'a', bs[i], ans1[i] + 'a');
    if (id[i] == 4)
      printf("lea e%cx, [e%cx + %d*e%cx]\n", i + 'a', ans1[i] + 'a', bs[i],
             ans2[i] + 'a');
  }
}
void DFS(int x, int maxans) {
  if (reg[x - 1] > n) {
    return;
  }
  if (flag) return;
  if (x > maxans) {
    if (reg[x - 1] == n) PrintAns(), flag = 1;
    return;
  }
  id[x] = 1;
  for (int i = 0; i < x; i++) {
    reg[x] = reg[i];
    ans1[x] = i;
    DFS(x + 1, maxans);
  }
  id[x] = 2;
  for (int i = 1; i < x; i++) {
    for (int j = 0; j < x; j++) {
      ans1[x] = i, ans2[x] = j;
      reg[x] = reg[i] + reg[j];
      DFS(x + 1, maxans);
    }
  }
  id[x] = 3;
  for (int i = 1; i <= 4; i++) {
    for (int j = 0; j < x; j++) {
      bs[x] = prame[i];
      ans1[x] = j;
      reg[x] = reg[j] * prame[i];
      DFS(x + 1, maxans);
    }
  }
  id[x] = 4;
  for (int i = 1; i <= 4; i++) {
    for (int j = 0; j < x; j++) {
      for (int k = 0; k < x; k++) {
        ans1[x] = j, ans2[x] = k;
        bs[x] = prame[i];
        reg[x] = reg[j] + prame[i] * reg[k];
        DFS(x + 1, maxans);
      }
    }
  }
}
bool Get_Solution(int x) {
  reg[0] = 1;
  ans = x;
  DFS(1, x);
  return flag;
}
int main() {
  n = read();
  if (n == 1) puts("0"), exit(0);
  for (int i = 1; i <= 5; i++)
    if (Get_Solution(i)) return 0;
  return 0;
}
