#include <bits/stdc++.h>
using namespace std;
int n, ans, m, t;
int va[15], ka[15], xa[15], ya[15], za[15];
int dfs(int lev) {
  if (lev == 0) {
    for (int i = 1; i <= m; i++)
      if (va[i] == n) return 1;
    return 0;
  }
  int M = m;
  for (int y = 1; y <= M + 1; y++)
    for (int z = 1; z <= M; z++)
      for (int k = 0; k <= 3; k++) {
        va[++m] = va[y] + va[z] * (1 << k);
        ka[++t] = 1 << k;
        xa[t] = m - 1;
        ya[t] = y - 1;
        za[t] = z - 1;
        if (dfs(lev - 1)) return 1;
        va[m] = 0;
        m--;
        t--;
      }
  return 0;
}
int main() {
  scanf("%d", &n);
  if (n == 1) {
    puts("0");
    return 0;
  }
  va[++m] = 1;
  while (!dfs(++ans))
    ;
  printf("%d\n", ans);
  for (int i = 1; i <= t; i++)
    printf("lea e%cx, [e%cx + %d*e%cx]\n", xa[i] + 'a', ya[i] + 'a', ka[i],
           za[i] + 'a');
  return 0;
}
