Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

var sc = bufio.NewScanner(os.Stdin)

func read() string {
	sc.Scan()
	return sc.Text()
}

func main() {
	sc.Split(bufio.ScanLines)
	for sc.Scan() {
		n, _ := strconv.ParseFloat(sc.Text(), 64)
		ans := n
		sum := n
		for i := 2; i <= 10; i++ {
			if i%2 == 0 {
				ans *= 2
				sum += ans
			} else {
				ans /= 3
				sum += ans
			}
		}
		fmt.Println(sum)
	}
}

C++: #include <cstdio>
#include <algorithm>
#include <iostream>
#include <vector>
#include <string>
#include <cmath>
using namespace std;

int main(){
	double n;
	while(cin >> n){
		printf("%lf\n",n*7.81481481481);
	}
return 0;
}

C++: //include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <complex>
#include <math.h>

using namespace std;

//conversion
//------------------------------------------
inline long toLong(string s) {long v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

//math
//-------------------------------------------
template<class T> inline T sqr(T x) {return x*x;}

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<long, long> PLL;
typedef long long LL;
//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(long i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------

//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))

const double EPS = 1e-9;
const double INF = 1e9;




int main(){
	double a;
	while(cin>>a){
		double sum=0.0;
		REP(i,10){
			sum+=a;
			if(i%2==1)a/=3.0;
			else a*=2.0;
		}
		cout<<fixed<<setprecision(7)<<sum<<endl;
	}
	return 0;
}
/*

*/

C++: #include<iostream>
#include<cstdio>
using namespace std;

int main(){
  int i,j,n;
  double sum=0,im,im2[1000];

  while(cin >> im){
    sum=0;
    im2[1]=im;
    sum+=im;
    for(i=2;i<=10;i++){
      if(i%2 == 0){
	im2[i]=im2[i-1]*2;
	sum+=im2[i];
      }
      else{
	im2[i]=im2[i-1]/3;
	sum+=im2[i];
      }
      //cout << "im2["<<i<<"] = "<<im2[i]<<endl;

    }

    printf("%.8f\n",sum);

  }

}

C++: #include<iostream>
using namespace std;

int main() {
	double d;
	while (cin >> d) {
		double n=d;
		for (int i = 2; i <= 10; i++) {
			if (i % 2 == 0) {
				n = n * 2;
			}
			else if (i % 2 == 1) {
				n = n / 3;
			}
			d += n;
		}
		cout << d << endl;
	}
}

C++: #include	<iostream>
#include	<cstdio>

using namespace std;

int main(void) {
	while(1) {
		double seq[10] = { 0.0 };
		double sum = 0;
		cin >> seq[0];
		
		if( cin.eof() )		break;
		sum += seq[0];
		for(int i = 1; i < 10; i++) {
			if(i % 2 == 1) {
				seq[i] = seq[i - 1] * 2;
			} else {
				seq[i] = seq[i - 1] / 3;
			}
			sum += seq[i];
		}
		printf("%.8f\n", sum);
	}
	
	return 0;
}

C++: #include<iostream>
#include<vector>
#include<string>
#include<string.h>
#include<math.h>
#include<utility>
#include<algorithm>
#include<functional>
using namespace std;

 
int main()
{
	while(true)
	{
	double a=0;
	double s=0;
	cin>>a;
	s=a;
	for(int i=0;i<4;i++)
	{
	a=2*a;
	s=s+a;
	a=a/3;
	s=s+a;

	}
	s=s+a*2;
	cout<<s<<endl;
	}
    return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <complex>
using namespace std;

#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()

int main() {
  double a;
  while(cin>>a){
    double ans = a;
    for(int i=2;i<=10;i++) {
      if (i%2==1)
        a/=3;
      else
        a*=2;
      ans += a;
    }
    printf("%.8lf\n",ans);
  }
}

C++: #include<cstdio>

using namespace std;

double num(double);

int main(void){
	double a,sum;

	while((scanf("%lf",&a))!=0){
		sum=num(a);
		printf("%.5f\n",sum);
	}

	return 0;
}

double num(double x){
	int i;
	double data[11],sum=0;

	data[1]=x;
	for(i=2;i<=10;i++){
		if(i%2==0){
			data[i]=data[i-1]*2;
		}
		else{
			data[i]=data[i-1]/3;
		}
	}
	for(i=1;i<=10;i++){
		sum+=data[i];
	}

	return sum;
}

C++: #include <iostream>

using namespace std;

void solve()
{
	double a;
	while(cin >> a)
	{
		double sum = a;
		for(int i = 0; i < 9; ++i)
		{
			if(i % 2 == 0)
			{
				a *= 2;
			}
			else
			{
				a /= 3;
			}
			sum += a;
		}
		printf("%.8f\n", sum);
	}
}

int main()
{
	solve();
	return(0);
}

C++: #include <stdio.h>

int main(void){
	long double a;
	while(scanf("%Lf",&a) != EOF){
		printf("%f\n",a*211/27);
	}
return 0;
}

C++: #include <iostream>
#include <stdio.h>
#include <array>

using namespace std;

double a_1;
double s_n;
std::array<double , 10> arr ;

double fib(int i){
  if(i ==1){
  }else if(i % 2 == 0){
    arr[i] = arr[i-1] * 2;
  }else{
    arr[i] = arr[i-1] / 3;
  }
  return arr[i];
}

int main(void){

  std::cin >> a_1;
  arr[1] = a_1;
  scanf("%lf", &a_1);

  for(int i = 1; i <= 10; i++){
    s_n += fib(i);
    if(i == 10){
      printf("%lf", s_n);
    }
  }

  return 0;
}

C++: #include <iostream>
#include <cstdio>
using namespace std;

int main(){
	double a;
	while(cin >> a){
		double s[20]={};
		s[0] = a;
		for(int i = 1 ; i < 10 ; i++)
			if( i % 2 == 1 ) s[i] = s[i-1] * 2;
			else s[i] = s[i-1] / 3;
		double sum = 0;
		for(int i = 0 ; i < 10 ; i++)
			sum += s[i];
		printf("%.10lf\n",sum);
	}
}

C++: //12
#include<iostream>
#include<iomanip>

using namespace std;

int main(){
  for(double seq[10];cin>>seq[0];){
    double sum=seq[0];
    for(int i=1;i<10;i++){
      if(i%2!=1){
	seq[i]=seq[i-1]/3;
      }else{
	seq[i]=seq[i-1]*2;
      }
      sum+=seq[i];
    }
    cout<<fixed<<setprecision(6)<<sum<<endl;
  }
  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
#define FOR(i,k,n) for(int i = (k); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define INF 114514810
#define MOD 1000000007
#define ALL(a) (a).begin(),(a).end()
#define pb(x) push_back(x)
#define ms(m,v) memset(m,v,sizeof(m))
#define D10  fixed<<setprecision(10) 
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int, int> P;
typedef long long ll;

long double a[100];
int main()
{
	while (cin >> a[0])
	{
		auto sum = a[0];
		FOR(i, 1, 10)
		{
			if (i % 2 == 0) a[i] = a[i-1] / 3;
			else a[i] = a[i - 1] * 2;
			sum += a[i];
		}
		cout <<D10<< sum << endl;
	}
}

C++: #include <bits/stdc++.h>

using namespace std;
using ll = long long;
using pii = pair<int, int>;

int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(false);
  cout << fixed << setprecision(10);
  
  double a;
  while (cin >> a) {
    double ans = a;
    for (int i = 2; i <= 10; i++) {
      if (i & 1) a /= 3;
      else a *= 2;
      ans += a;
    }
    cout << ans << endl;
  }

  return 0;
}