dwango2016hA.cpp

#include <algorithm>
#include <cmath>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <functional>

using namespace std;

#define LOG(...) printf(__VA_ARGS__)
//#define LOG(...)
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define RSORT(c) sort((c).rbegin(),(c).rend())
#define CLR(a) memset((a), 0 ,sizeof(a))

typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int dx[] = { -1, 0, 1, 0 }; const int dy[] = { 0, 1, 0, -1 };
map<ll, ll> dp;
vector<ll> nico;
ll ans(ll n){
	if (dp.find(n) != dp.end())
		return dp[n];
	ll a = 1000000000000000001;
	REP(i, nico.size()){
		a = min(a, ans(n/nico[i]) + n%nico[i]);
	}
	dp[n] = a;
	return a;
}
int main() {
	string s2 = "2";
	string s5 = "5";
	nico.push_back(2);
	nico.push_back(5);
	while (1){
		if ((s2.length() % 2) == 1)
			s2 += "5";
		else
			s2 += "2";
		if (atoll(s2.c_str()) < 1000000000000000000)
			nico.push_back(atoll(s2.c_str()));
		else
			break;
		if ((s5.size() % 2) == 1)
			s5 += "2";
		else
			s5 += "5";
		nico.push_back(atoll(s5.c_str()));
	}
	long long n;
	cin >> n;
	dp[0] = 0;
	dp[1] = 1;
	cout << ans(n) << endl;
}