#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp> 
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
using namespace std;
#define getbit(n, i) (((n) & (1LL << (i))) != 0) 
#define setbit0(n, i) ((n) & (~(1LL << (i)))) 
#define setbit1(n, i) ((n) | (1LL << (i))) 
#define togglebit(n, i) ((n) ^ (1LL << (i))) 
#define lastone(n) ((n) & (-(n))) 
char gap = 32;
#define ll long long 
#define lll __int128_t
#define pb push_back
typedef tree<
int,
null_type,
less<int>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll hashPrime = 1610612741;
ll status[200000];
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    ll n;
    ll i,j,k,l;
    cin >> n;
    vector <ll> res;
    res.pb(6);
    res.pb(10);
    res.pb(15);
    ll cnt = 0;
    ll curr = 6;
    status[6] = status[10] = status[15] = 1;
    for(i = 1 ; i <= n - 3 ; ){
        while(curr <= 10000 and status[curr] == 1){
            if(cnt == 0)
                curr = curr + 6;
            else if(cnt == 1)
                curr = curr + 10;
            else 
                curr = curr + 15;   
        }
        if(curr > 10000){
            if(cnt == 0){
                cnt = 1;
                curr = 10;
            }
            else if(cnt == 1){
                cnt = 2;
                curr = 15;
            }
        }
        if(status[curr] == 0){
            status[curr] = 1;
            res.pb(curr);
            i++;
        }
    }
    for(i = 0 ; i < n;i++){
        cout << res[i] << " ";
    }
    cout << "\n";
    return 0;
}
#include <bits/stdc++.h>

using namespace std;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);

  int n;
  cin >> n;

  double ans = 0;
  for (int i = 1; i <= n; ++i) {
    ans += 1.0 / i;
  }
  ans = n * ans - 1;

  cout << fixed << setprecision(12) << ans << '\n';

  return 0;
}
