#include <bits/stdc++.h>
const int inf = 1e9 + 9;
const int N = 2e5 + 5;
using namespace std;
inline int read() {
  int s = 0, w = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') w = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    s = s * 10 + ch - '0';
    ch = getchar();
  }
  return s * w;
}
int n, ans, a[25], a1[25], a2[25], a3[25], p[25];
void dfs(int x) {
  if (a[x] == n && x == ans) {
    printf("%d\n", ans);
    for (int i = 0; i < ans; i++)
      if (~a2[i])
        printf("lea e%cx, [e%cx + %d*e%cx]\n", a1[i] + 'a', a2[i] + 'a', p[i],
               a3[i] + 'a');
      else
        printf("lea e%cx, [%d*e%cx]\n", a1[i] + 'a', p[i], a3[i] + 'a');
    exit(0);
  }
  if (x == ans) return;
  for (int i = 0; i <= x; i++)
    for (int j = -1; j <= x; j++)
      for (int k = 1; k < 9; k <<= 1) {
        if (j + 1)
          a[x + 1] = a[i] * k + a[j];
        else
          a[x + 1] = a[i] * k;
        a1[x] = x + 1, a2[x] = j, a3[x] = i, p[x] = k;
        dfs(x + 1);
      }
}
int main() {
  n = read();
  a[0] = 1;
  for (ans = 0; ans <= n; ans++) dfs(0);
}
