#include <bits/stdc++.h>
using namespace std;
int n;
vector<pair<int, pair<int, int>>> a, u(8);
void gao() {
  if (a.back().first == n) u = a;
  if (a.size() + 1 >= u.size()) return;
  for (size_t i = 0; i < a.size(); i++)
    for (size_t j = 1; j < a.size(); j++) {
      for (int m = 1; m <= 8; m *= 2) {
        int s = a[i].first + m * a[j].first;
        if (s <= n) {
          a.push_back({s, {i, j}});
          gao();
          a.pop_back();
        }
      }
    }
}
int main() {
  scanf("%d", &n);
  a.push_back({0, {0, 0}});
  a.push_back({1, {0, 0}});
  gao();
  printf("%d\n", u.size() - 2);
  for (size_t i = 2; i < u.size(); i++) {
    int x = u[i].second.first, y = u[i].second.second;
    int m = (u[i].first - u[x].first) / u[y].first;
    printf("lea e%cx, [", i + 'a' - 1);
    if (x) printf("e%cx + ", x + 'a' - 1);
    if (m >= 2) printf("%d*", m);
    printf("e%cx]\n", y + 'a' - 1);
  }
}
