#include <bits/stdc++.h>
using namespace std;
int n, ans, val[10] = {1}, ans1[11], ans2[11], ans3[11], p[11];
inline void dfs(int x) {
  if (val[x] == n and x == ans) {
    printf("%d\n", ans);
    for (int i = 0; i < ans; ++i)
      if (~ans2[i])
        printf("lea e%cx, [e%cx + %d*e%cx]\n", ans1[i] + 'a', ans2[i] + 'a',
               p[i], ans3[i] + 'a');
      else
        printf("lea e%cx, [%d*e%cx]\n", ans1[i] + 'a', p[i], ans3[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)
          val[x + 1] = val[i] * k + val[j];
        else
          val[x + 1] = val[i] * k;
        ans1[x] = x + 1, ans2[x] = j, ans3[x] = i, p[x] = k;
        dfs(x + 1);
      }
}
int main() {
  scanf("%d", &n);
  for (ans = 0; ans <= n; ++ans) dfs(0);
}
