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;

#define lint long long
#define P pair<int, int>
#define LLP pair<long long, long long>
#define REP(i, x, n) for(int i = (x), i##_len = (int)(n) ; i < i##_len ; ++i)
#define rep(i, n) for(int i = 0, i##_len = (int)(n) ; i < i##_len ; ++i)
#define repr(i, n) for(int i = (int)(n) - 1 ; i >= 0 ; --i)
#define SORT(x) sort((x).begin(), (x).end())
#define SORT_INV(x) sort((x).rbegin(), (x).rend())

const int IINF = 1e9 + 100;
const long long LLINF = 2e18 + 129;
const long long MOD = 1e9 + 7;
const int dx4[] = {1, 0, -1, 0}, dy4[] = {0, 1, 0, -1};
const int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dy8[] = {0, -1, -1, -1, 0, 1, 1, 1};
const double EPS = 1e-8;

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

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

    return 0;
}

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

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

#define pb push_back
#define rep(i, n) for(int i = 0; i < (n); i++)
#define FOR(i, a, n) for(int i = a; i < (n); i++)
#define mod (ll)(1e9+7)
#define int ll
#define INF 100000000

__attribute__((constructor))
void initial() {
  cin.tie(0);
  ios::sync_with_stdio(false);
}

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

C++: #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i,s,e) for(int (i) = (s);(i) <= (e);(i)++)
#define all(x) x.begin(),x.end()

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;
}

C++: #include <iostream>
using namespace std;
int main(void){
    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++: #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
template <class A, class B> inline bool chmax(A &a, const B &b) { return b > a && (a = b, true); }
template <class A, class B> inline bool chmin(A &a, const B &b) { return b < a && (a = b, true); }
typedef long long ll;
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<long long> vlong;
typedef vector<string> vstring;
#define vpush(a,x) a.push_back(x);
#define rep(i, n) REP(i, 0, n)
#define all(v) v.begin(), v.end()
#define REP(i, x, n) for(int i = x; i < n; i++)
const int INF = 1 << 30;
const ll LINF = (ll)1 << 60;
const int dx[] = {1,0,-1,0,1,1,-1,-1};
const int dy[] = {0,-1,0,1,1,-1,-1,1};
#define stp(x)  setprecision(x)
const long double PI=3.14159265358979323846264338327950;
int main(){
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  int w;
  cin>>w;
  cout<<32*w<<'\n';
  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>
using namespace std;
int main(void){
    int n;
    cin >> n;
    cout << n*32 << endl;
    return 0;
}

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

int main(){
  int W;
  cin>>W*32;
  return 0;
}

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

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

C++: #include<stdio.h>
int main(void)
{
	int w;
	scanf("%d",&w);
	w=w*32;
	printf("%d\n",w);
	return 0;
}

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

using namespace std;

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

C++: #include <algorithm>
#include <iostream>
#include <math.h>
#include <cstdio>
#include <string.h>
using namespace std;
int main(void){
	int w;
	cin>>w;
	cout<<w*32<<endl;
	return 0;
}

C++: #include<bits/stdc++>
using namespace std;
int main(){
  int w;
  cin >> w;
  cout << w*4;
  return 0;

}

C++: #include <iostream>
#include <algorithm>
#include <iomanip>
#include <math.h>
using namespace std;
int main(){
  cin.tie(NULL);
  ios::sync_with_stdio(false);
  int w;
  cin>>w;
  cout<<w*32<<"\n";
  return 0;
}

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

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

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

C++: #include<iostream>
using namespace std;
int main(void)
{
	int w;
	cin>>w;
	cout<<w*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>
using namespace std;
int main(){
    int R,T;
    cin>>R;
    T=R*32;
    cout<<T<<endl;
    return 0;
}

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

int main()
{

  int n;

  cin >>n;

  cout << n*32 << endl;
}

C++: #include<stdio.h>
int main()
{
	int a;
	scanf("%d",&a);
	printf("%d\n",a*32);
	return 0;
}

C++: //PCK2016予選問題
#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(void){
    int x;
    cin>>x;
cout<<x*32<<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 h,r;
    cin>>h>>r;
    if(h+r>0) cout<<1<<endl;
    else if(h+r==0) cout<<0<<endl;
    else cout<<-1<<endl;
    return 0;
}

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

C++: print(input()*32)

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

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

C++: #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
#define down_queue(x) priority_queue<x>
#define up_queue(x) priority_queue<x, vector<x>, greater<x>>
#define vec(x) vector<x>
#define IINF INT_MAX
#define LLINF LLONG_MAX
ll gcd(ll a,ll b){while(b){ll tmp = a % b;a = b;b = tmp;}return a;}
ll lcm(ll a,ll b){return a / gcd(a,b) * b;}
#define rep(x, y) for(int x = 0; x < (y); x++)
#define REP(x, z, y) for(int x = (z); x < (y); x++)
#define all(x) x.begin(), x.end()
#define split_str(str, sp_word) istringstream stream(str); string res; for(int cnt = 0; getline(stream,res,sp_word); cnt++)
#define digit(x) ((int)log10((double)(x)) + 1)
#define mp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define pf(x) push_front(x)
#define out(x) for(auto i : x) cout << i << " "; cout << endl;
#define outln(x) for(auto i : x) cout << i << endl;
#define vec_cpy(to,from) copy(all(to),back_inserter(from))
#define ary_cpy(to,from) memcpy(to, from, sizeof from)
#define MOD 1000000007
#define DEBUG true

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

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

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

C++: #include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;

int main() {
	int w; scanf("%d", &w);
	printf("%d\n", w * 32);
}

C++: #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <stdio.h>
#include <cstring>
#include <queue>
#include <stack>
#include <functional>
using namespace std;
#define Would
#define you


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

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

int main(){
    int W;

    cin >> W;

    cout << W*32 << endl;

    return 0;
}

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

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

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

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