#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>

#define pb push_back
#define puts(x) cout << #x << " : " << x << endl;
#pragma GCC diagnostic ignored "-Wconversion"

#define REP(i,n) for (int i=0;i<(n);i++)
#define REPE(i,n) for (int i=0;i<=(n);i++)

#define init(a,b) memset((a), (b), (sizeof(a)));

using namespace std;

typedef long long ll;
typedef pair<int, int> P;

#if 0
#include <iostream>
#include <fstream>
ifstream fin("/tmp/input.txt");
#define cin fin
#endif

int main() {
    int N; cin >> N;
    N *= 100;
    double res = 0;
    double total = 1000*1000;
    double normal = total - N;
    double arrested = N * 0.99 + normal * 0.01;
    cout << normal / arrested << endl;
    return 0;
}