// Stern-Brocot tree
#include
#include
#include
#include
#include
#include
#include
using namespace std;
#define REP(i,n) for(int i=0;i<(n);++i)
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define RFOR(i,a,b) for(int i=(a);i>=(b);--i)
typedef long long LL;
vector split( const string& s, const string& delim =" " ) {
vector res;
string t;
for ( int i = 0 ; i != s.size() ; i++ ) {
if ( delim.find( s[i] ) != string::npos ) {
if ( !t.empty() ) {
res.push_back( t );
t = "";
}
} else {
t += s[i];
}
}
if (!t.empty() ) {
res.push_back(t);
}
return res;
}
vector splitInt( const string& s, const string& delim =" " ) {
vector tok = split( s, delim );
vector res;
for ( int i = 0 ; i != tok.size(); i++ )
res.push_back( atoi( tok[i].c_str() ) );
return res;
}
LL gcd(LL a,LL b){
return b?gcd(b,a%b):a;
}
inline LL lcm(LL a,LL b){
return a/gcd(a,b)*b;
}
int s2i(string s) {
stringstream ss;
ss << s;
int res;
ss >> res;
return res;
}
string i2s(int n) {
stringstream ss;
ss << n;
string res;
ss >> res;
return res;
}
void run() {
int ln = 0, ld = 1, rn = 1, rd = 1;
while (true) {
//cout << ln << "/" << ld << " - " << rn << "/" << rd << endl;
int mn = ln + rn, md = ld + rd;
if (md > 1000000) break;
if (md * 3 <= mn * 7) {
rn = mn, rd = md;
} else {
ln = mn, ld = md;
}
}
cout << ln << endl;
}
int main() {
run();
}