Go: package main

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

var sc = bufio.NewScanner(os.Stdin)

func main() {
	sc.Scan()
	W, _ := strconv.Atoi(sc.Text())
	fmt.Println(W * 32)
}

C++: #include <iostream>
#include <string>
#include <map>
#include <vector>
#include <utility>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <cmath>

#define rep(i,j,k) for(int i=(int)j;i<(int)k;i++)
#define itrep(i,x) for(auto i=(x).begin(); i!=(x).end();i++)
#define Sort(x) sort((x).begin(),(x).end())
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define vec vector
#define INF (int)1e9
#define INFL 1e18
#define MOD 1000000007
#define pb push_back
#define MP make_pair
#define PI 3.1415926535
typedef long long int ll;
typedef std::pair<int,int> P;
int D=1;
int dx[4]={0,1,0,-1},dy[4]={-1,0,1,0};

using namespace std;

bool comb(pair<int,int> a,pair<int,int> b){
    if(a.first==b.first){
        return a.second>b.second;
    }else return a>b;
}

int main(){
    int n;cin>>n;cout<<n*32<<endl;
    return 0;
}

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

int main(){
    int x;
    int i=1;
    cin >> x;
    cout << x*32 << endl;

}

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


  
int main(){
  

  int W;
  cin >>  W ;
  cout  << W*32 << "\n";
 return 0;
}

C++: //https://onlinejudge.u-aizu.ac.jp/challenges/sources/PCK/Prelim/0335?year=2016

#include <bits/stdc++.h>

using namespace std;

int main() {
    int n;
    cin >> n;

    cout << n * 32 << endl;
    return 0;
}

/*
 *
 */

C++: #include<iostream>
using namespace std;
int main(){
    int n;
    cin>>n;
    cout<<n*32<<endl;
    return 0;
}

C++: #include <iostream>
using namespace std;
int main(void){
    int a;
    cin>>a;
    cout<<a*32<<endl;
}

C++: #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;

int main() {
    int w;
    cin >> w;
    cout << w * 32 << endl;
}

C++: #include <iostream>
using namespace std;
int main(void){
    int w;
    cin >> w;
    cout << 32*w<<endl;
    
    
}

C++: #include <map>
#include <set>
#include <list>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <numeric>
#include <utility>
#include <iostream>
#include <algorithm>
#include <functional>

using namespace std;

#define INF (1 << 30)
#define INFL (1LL << 62)
#define MOD7 1000000007
#define MOD9 1000000009
#define EPS 1e-10

#define ll long long
#define ull unsigned long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pul pair<ull, ull>
#define all(a) (a).begin(), (a).end()
#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);--i)
#define REP(i,n) for (int i=0;i<(n);++i)
#define RREP(i,n) for (int i=(n)-1;i>=0;--i)

void YES() { cout << "YES" << endl; }
void NO() { cout << "NO" << endl; }
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
void yes() { cout << "yes" << endl; }
void no() { cout << "no" << endl; }
void Taka() { cout << "Takahashi" << endl; }
void Aoki() { cout << "Aoki" << endl; }
void digit(int d) { cout << fixed << setprecision(d); }
void IOup() { cin.tie(0); ios::sync_with_stdio(false); }

int main() {
	int w;
	cin >> w;
	cout << w * 32 << endl;

	return 0;
}

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

using namespace std;

int main(void) {
  int w;
  cin >> w;
  cout << 32 * w << endl;

  return 0;
}

C++: #include<iostream>
using namespace std;
int main()
{
 int w;
 cin>>w;
cout<<w*32<<endl;
return 0;
}