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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

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

C++: #include<bits/stdc++.h>
using namespace std;
    int main(){
        int W;
        cin>>W;
        cout<<W*32<<'\n';
    return(0);
}

C++: #include <iostream>
#include <iomanip>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#include <numeric>
#include <functional>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(ll i=ll(a);i<ll(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define PRINT(V) cout << V << "\n"
#define SORT(V) sort((V).begin(),(V).end())
#define RSORT(V) sort((V).rbegin(), (V).rend())
using namespace std;
using ll = long long;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
inline void Yes(bool condition){ if(condition) PRINT("Yes"); else PRINT("No"); }
template<class itr> void cins(itr first,itr last){
    for (auto i = first;i != last;i++){
        cin >> (*i);
    }
}
template<class itr> void array_output(itr start,itr goal){
    string ans = "",k = " ";
    for (auto i = start;i != goal;i++) ans += to_string(*i)+k;
    if (!ans.empty()) ans.pop_back();
    PRINT(ans);
}
ll gcd(ll a, ll b) {
    return a ? gcd(b%a,a) : b;
}
const ll INF = 1e15;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> tri;
typedef pair<double,double> point;
const ll MAX = 30000;
constexpr ll nx[8] = {1,0,-1,0,1,-1,1,-1};
constexpr ll ny[8] = {0,1,0,-1,1,1,-1,-1};
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll w;
    cin >> w;
    PRINT(w*32);
}

C++: #include "bits/stdc++.h"

using namespace std;
using ll = long long;
using ull = unsigned long long;

typedef pair<ll, ll> P;
typedef pair<ll, P> PP;
typedef pair<P, P> PPP;

const ll MOD = 1e9 + 7;
const ll INF = 9e18;
const double DINF = 5e14;
const double eps = 1e-10;
const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 };

#define ALL(x) (x).begin(),(x).end()
#define ALLR(x) (x).rbegin(),(x).rend()
#define pb push_back
#define eb emplace_back
#define fr first
#define sc second

int n;

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

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

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

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

using namespace std;

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

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

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

using namespace std;

int w,h,n;
int d[100001]={};

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

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

#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,n) for(int i=1;i<=(n);i++)
#define lol long long
#define SUM(n) ((n)+1)*(n)/2 //1〜nまでの総和を求める式
#define mp make_pair
#define fi first
#define se second
#define pu push_back
#define SYOU(x) fixed<<setprecision(x+1) //小数点桁数を指定する
#define abs(x,y) max(x,y)-min(x,y)
#define all(v) v.begin(),v.end()
#define UPDigit(a,b) (a+b-1)/b //小数点切り上げ
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
const int MOD=int(1e9)+7; 
using namespace std;
using pii = pair<int, int>;
typedef vector<int> vit;

signed main(void){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  int w;
  cin >> w;
  cout << w * 32 << '\n';
  return 0;
}

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

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

  return 0;

}

C++: #include<bits/stdc++.h>
using namespace std;

int main(){
	int H, R;
	cin>>H>>R;

	if(H - R <= 0) cot<<"0"<endl;
	if(H < 0) cot<<"-1"<endl;
	if(H > 0) cot<<"1"<endl;
	return 0;
}

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

C++: #include<bits/stdc++.h>
using namespace std;
#define all(vec) vec.begin(),vec.end()
typedef long long int ll;
typedef pair<ll,ll> P;
const ll MOD=1000000007;
const ll INF=1000000010;
const ll LINF=4000000000000000010LL;
const int MAX=310;
const double EPS=1e-9;
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
int main(){
    int w;cin>>w;cout<<w*32<<endl;
    return 0;
}

C++: 
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<utility>
#include<queue>
using namespace std;
int main() {

	int w;
	cin >> w;
	cout << w * 32 << endl;

}

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

C++: #include <bits/stdc++.h>
using namespace std;
int main() {
  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
}

C++: #include <bits/stdc++.h>
using nameplae std;

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

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
	int a,;
	cin>>a;
	cout<<a*32<<endl;
	return 0;
}

C++: #include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
//---------------------------------------------------------------------------------------------------
/*---------------------------------------------------------------------------------------------------
　　　　　　　　　　　 ∧＿∧  
　　　　　 ∧＿∧ 　（´<_｀ ）　 Welcome to My Coding Space!
　　　　 （ ´_ゝ`）　/　 ⌒i     
　　　　／　　　＼　 　 |　|     
　　　 /　　 /￣￣￣￣/　　|  
　 ＿_(__ﾆつ/　    ＿/ .| .|＿＿＿＿  
　 　　　＼/＿＿＿＿/　（u　⊃  
---------------------------------------------------------------------------------------------------*/






int W;
//---------------------------------------------------------------------------------------------------
void _main() {
    cin >> W;
    int ans = W * 32;
    cout << ans << endl;
}

C++: #include <bits/stdc++.h>
using namespace std;

int main(){
  

  
    int W ;
    cin>> W ;
      
    cout<<W*32 <<endl;
  

  return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;

int main(){
	int W;

	cin>>W;

	cout<<W * 32<endl;

	return 0;
}

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

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

C++: #include <bits/stdc++.h>
using namespace std;

int main(){

  int H;
  if(-i000<=H&&H<0){
  }else if(H=0){
  }else if(0<H&&H<=1000){
  }else
  return 0;
 }

C++: #include<bits/stdc++.h>
#define all(v) v.begin(),v.end()
typedef long long ll;
using namespace std;
int main(){
	int n;cin>>n;
	cout<<n*32<<endl;
}

C++: #include <bits/stdc++.h>
using namespace std;

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