#include <bits/stdc++.h>
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define R(i, x, y) for (int i = (x); i >= (y); i--)
#define FIO(FILE) freopen(FILE".in", "r", stdin), freopen(FILE".out", "w", stdout)

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
bool Mbe;

const int N = 10;
double fc[N];

void solve() {
	double x; cin >> x;
	// x = x / 1024;
	printf("25\n");
	printf("$1 = $1 * 0.0009765625\n");
	fc[0] = 1;
	F (i, 1, 7) fc[i] = fc[i - 1] / i;
	// printf("$0 = %.14lf\n", fc[7]);
	// double y = fc[7];
	R (i, 6, 0) {
		// y = y * x + fc[i];
		if (i != 6) printf("$0 = $0 * $1\n");
		else printf("$0 = %.14lf * $1\n", fc[7]);
		printf("$0 = $0 + %.14lf\n", fc[i]);
	}
	F (i, 0, 9) {
		// y = y * y;
		printf("$0 = $0 * $0\n");
	}
	// out(y);
}

bool Med;
int main() {
	// FIO("");
	// ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cerr << (&Mbe - &Med) / 1048576.0 << " MB\n";
	int T = 1;
	// cin >> T;
	while (T--) solve();
	cerr << (int)(1e3 * clock() / CLOCKS_PER_SEC) << " ms\n";
	return 0;
}