#include <bits/stdc++.h>
using namespace std;
int ans, n, v[10] = {1}, r1[10], r2[10], p[10], r3[10];
void dfs(int u) {
  if (u == ans && v[u] == n) {
    printf("%d\n", ans);
    for (int i = 0; i < u; i++)
      if (r2[i] + 1)
        printf("lea e%cx, [e%cx + %d*e%cx]\n", r1[i] + 'a', r2[i] + 'a', p[i],
               r3[i] + 'a');
      else
        printf("lea e%cx, [%d*e%cx]\n", r1[i] + 'a', p[i], r3[i] + 'a');
    exit(0);
  }
  if (u == ans) return;
  for (int i = 0; i <= u; i++)
    for (int j = -1; j <= u; j++)
      for (int k = 1; k < 9; k <<= 1) {
        if (j + 1)
          v[u + 1] = v[i] * k + v[j];
        else
          v[u + 1] = v[i] * k;
        if (v[u + 1] <= v[u] || v[u + 1] > n) continue;
        r1[u] = u + 1;
        r2[u] = j;
        p[u] = k;
        r3[u] = i;
        dfs(u + 1);
      }
}
int main() {
  scanf("%d", &n);
  for (ans = 0;; ans++) dfs(0);
}
