Problem: After the Search Ultimate program that searched for strings in a text failed, Igor K. got to think: "Why on Earth does my program work so slowly?" As he double-checked his code, he said: "My code contains no errors, yet I know how we will improve Search Ultimate!" and took a large book from the shelves. The book read "Azembler. Principally New Approach".

Having carefully thumbed through the book, Igor K. realised that, as it turns out, you can multiply the numbers dozens of times faster. "Search Ultimate will be faster than it has ever been!" — the fellow shouted happily and set to work.

Let us now clarify what Igor's idea was. The thing is that the code that was generated by a compiler was far from perfect. Standard multiplying does work slower than with the trick the book mentioned.

The Azembler language operates with 26 registers (eax, ebx, ..., ezx) and two commands: 

  * [x] — returns the value located in the address x. For example, [eax] returns the value that was located in the address, equal to the value in the register eax. 
  * lea x, y — assigns to the register x, indicated as the first operand, the second operand's address. Thus, for example, the "lea ebx, [eax]" command will write in the ebx register the content of the eax register: first the [eax] operation will be fulfilled, the result of it will be some value that lies in the address written in eax. But we do not need the value — the next operation will be lea, that will take the [eax] address, i.e., the value in the eax register, and will write it in ebx. 



On the first thought the second operation seems meaningless, but as it turns out, it is acceptable to write the operation as 

lea ecx, [eax + ebx],

lea ecx, [k*eax]

or even

lea ecx, [ebx + k*eax],

where k = 1, 2, 4 or 8.

As a result, the register ecx will be equal to the numbers eax + ebx, k*eax and ebx + k*eax correspondingly. However, such operation is fulfilled many times, dozens of times faster that the usual multiplying of numbers. And using several such operations, one can very quickly multiply some number by some other one. Of course, instead of eax, ebx and ecx you are allowed to use any registers.

For example, let the eax register contain some number that we should multiply by 41. It takes us 2 lines:

lea ebx, [eax + 4*eax] // now ebx = 5*eax

lea eax, [eax + 8*ebx] // now eax = eax + 8*ebx = 41*eax

Igor K. got interested in the following question: what is the minimum number of lea operations needed to multiply by the given number n and how to do it? Your task is to help him.

Consider that at the initial moment of time eax contains a number that Igor K. was about to multiply by n, and the registers from ebx to ezx contain number 0. At the final moment of time the result can be located in any register.

Input

The input data contain the only integer n (1 ≤ n ≤ 255), which Igor K. is about to multiply.

Output

On the first line print number p, which represents the minimum number of lea operations, needed to do that. Then print the program consisting of p commands, performing the operations. It is guaranteed that such program exists for any n from 1 to 255.

Use precisely the following format of commands (here k is equal to 1, 2, 4 or 8, and x, y and z are any, even coinciding registers):

lea x, [y]

lea x, [y + z]

lea x, [k*y]

lea x, [y + k*z]

Please note that extra spaces at the end of a command are unacceptable.

Examples

Input

41


Output

2
lea ebx, [eax + 4*eax]
lea ecx, [eax + 8*ebx]


Input

2


Output

1
lea ebx, [eax + eax]


Input

4


Output

1
lea ebx, [4*eax]

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int XINYANG = 3;
struct status {
  int s[XINYANG];
};
int ans, n;
stack<string> out;
void Search_Alogirhtm(status cur, int step) {
  for (int i = 0; i < XINYANG; ++i)
    if (cur.s[i] == n) {
      ans = min(ans, step - 1);
      return;
    }
  for (int i = 0; i < XINYANG; ++i) {
    for (int j = 0; j < XINYANG; ++j) {
      if (cur.s[j] == 0)
        continue;
      else {
        if (step >= ans) return;
        for (int k = 1; k <= 8; (k <<= 1)) {
          if (step >= ans) return;
          status newst = cur;
          newst.s[i] = cur.s[j] * k;
          if (newst.s[i] > n) continue;
          Search_Alogirhtm(newst, step + 1);
        }
        for (int v = 0; v < XINYANG; ++v) {
          if (cur.s[v] == 0) continue;
          for (int k = 1; k <= 8; (k <<= 1)) {
            if (step >= ans) return;
            status newst = cur;
            newst.s[i] = cur.s[j] + k * cur.s[v];
            if (newst.s[i] > n) continue;
            Search_Alogirhtm(newst, step + 1);
          }
        }
      }
    }
  }
  return;
}
string Go(int i, int j, int k) {
  string res = "lea e";
  res.push_back(i + 'a');
  res.push_back('x');
  res = res + ", [";
  if (k != 1) {
    res.push_back(k + '0');
    res.push_back('*');
  }
  res.push_back('e');
  res.push_back(j + 'a');
  res.push_back('x');
  res.push_back(']');
  return res;
}
string Go(int i, int j, int v, int k) {
  string res = "lea e";
  res.push_back(i + 'a');
  res.push_back('x');
  res = res + ", [";
  res.push_back('e');
  res.push_back(j + 'a');
  res.push_back('x');
  res = res + " + ";
  if (k != 1) {
    res.push_back(k + '0');
    res.push_back('*');
  }
  res.push_back('e');
  res.push_back(v + 'a');
  res.push_back('x');
  res.push_back(']');
  return res;
}
bool Print_Ans(status cur, int step) {
  for (int i = 0; i < XINYANG; ++i)
    if (cur.s[i] == n) return true;
  for (int i = 0; i < XINYANG; ++i) {
    for (int j = 0; j < XINYANG; ++j) {
      if (cur.s[j] == 0)
        continue;
      else {
        if (step >= ans) return false;
        for (int k = 1; k <= 8; (k <<= 1)) {
          if (step >= ans) return false;
          status newst = cur;
          newst.s[i] = cur.s[j] * k;
          if (newst.s[i] > n) continue;
          if (Print_Ans(newst, step + 1)) {
            out.push(Go(i, j, k));
            return true;
          }
        }
        for (int v = 0; v < XINYANG; ++v) {
          if (cur.s[v] == 0) continue;
          for (int k = 1; k <= 8; (k <<= 1)) {
            if (step >= ans) return false;
            status newst = cur;
            newst.s[i] = cur.s[j] + k * cur.s[v];
            if (newst.s[i] > n) continue;
            if (Print_Ans(newst, step + 1)) {
              out.push(Go(i, j, v, k));
              return true;
            }
          }
        }
      }
    }
  }
  return false;
}
status S;
int main(int argc, char *argv[]) {
  scanf("%d", &n);
  ans = min(n, 6);
  for (int i = 0; i < XINYANG; ++i) S.s[i] = 0;
  S.s[0] = 1;
  Search_Alogirhtm(S, 1);
  Print_Ans(S, 0);
  printf("%d\n", ans);
  while (!out.empty()) {
    cout << out.top() << endl;
    out.pop();
  }
  return 0;
}