#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	string s; cin >> s;
	long long p = 0, q = 1;
	if (s.find('.') != std::string::npos) {
		int idx = -1;
		rep(i, s.size())if (s[i] == '.')idx = i;
		rep(i, idx) {
			p = p * 10 + s[i] - '0';
		}
		rep2(i, idx + 1, s.size()) {
			p = p * 10 + s[i] - '0';
			q *= 10;
		}
	}
	else {
		p = stol(s);
		q = 1;
	}
	//cout << p << " " << q << endl;
	int ans = 0;
	while (p) {
		ans++;
		long long np = q;
		long long nq = p;
		np %= nq;
		long long g = gcd(np, nq);
		np /= g;
		nq /= g;
		p = np, q = nq;
	}
	cout << ans << endl;
	return 0;
}