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 <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

int main() {
    int a;
    cin >> a;
    cout << a*32 << "\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 <iostream>
using namespace std;
int main(void){
    int a;
    cin>>a;
    cout<<a*32<<endl;
    
}

C++: //16-1
#include <iostream>
#include <fstream>
#include <stdio.h>
#include <math.h>
#include <time.h>
#include <string>
#include <vector>
#include <map>
#include <list>
#include <set>
#include <stack>
#include <queue>
#include <cstdlib>
#include <algorithm>
#include <random>
#include <cassert>
using namespace std;
#define LL long long
#undef INT_MIN
#undef INT_MAX
#define INT_MIN -2147483648
#define INT_MAX 2147483647
#define LL_MIN -9223372036854775808
#define LL_MAX 9223372036854775807
#define segment_size 65536
#define ROOP() while (true)

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

C++: #include <bits/stdc++.h>
using namespase 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 << W*32 << endl;
}

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

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

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

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

#define REP(i,n) for(int i=0;i<(n);i++)
#define REAP(i,a,n) for(int i=(a);i<(n);i++)
#define YES cout<<"Yes"<<endl
#define NO cout<<"No"<<endl
#define fr first
#define sc second
#define pb push_back
#define All(v) v.begin(),v.end()
typedef long long ll;

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

C++: #include<stdio.h>
int main() {
	int b, c=32;
	scanf("%d",&b);
	printf("%d\n", b*c);
	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() {
  int n; cin >> n;
  cout << n * 32 << endl;
}

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

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

C++: #include <stdio.h>
#include <iostream>
#include <string>
#include <cstdlib>

using namespace std;

int main(){
	int W;
	cin >> W;
	cout << W*32 << "\n";
}

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 <bits/stdc++.h>
 
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, init, n) for(int i = init; i < (n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
 
using namespace std;
using ll = long long int;
using P = pair<int, int>;
using T = tuple<int, int, int>;
using edge = struct
{
    int to, cost;
};
 
const int MOD = 1e9 + 7;
const int iINF = 1e9;
const long long int llINF = 1e18;
const double PI = acos(-1.0);
 
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};

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

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

#define INF 1.1e9
#define LINF 1.1e18
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) for (int i = (n) - 1; i >= 0; i--)
#define ALL(v) (v).begin(), (v).end()
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define BIT(x, n) bitset<n>(x)
#define PI 3.14159265358979323846

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

//-------------------------------------------------



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

	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;


}

C++: #include<iostream>
using namespace std;
int main(){
    int w;
    cin>>w;

    cout<<w*32<<"\n";
    return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<math.h>
#include<queue>

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 << w * 32 << endl;
  return 0;
}

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

int main(){
  int Y,E;
  
  cin>> Y,E;
  
  if ( E = 0 && 1868 <= Y <= 1911 ) 
    cout << "M" + Y - 1868 + 1 << endl;

  else if ( E = 0 && 1912 <= Y <= 1925 )
    cout << "T" + Y - 1912 + 1 << endl;

  else if ( E = 0 && 1926 <= Y <= 1988 )
    cout << "S" + Y - 1926 + 1 << endl;

  else if ( E = 0 && 1989 <= Y <= 2016 )
    cout << "H" + Y - 1989 + 1 << endl;

  else if ( E = 1 )
    cout << 1868 + Y - 1 <<endl;

  else if ( E = 2 )
    cout << 1912 + Y - 1 <<endl;

  else if ( E = 3 )
    cout << 1926 + Y - 1 <<endl;

  else cout << 1989 + Y - 1 << endl;

  return 0;
}

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

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

	      return 0;
}

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

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

C++: #include<bits/stdc++.h>
using namespace std;
int main(void)
{
	int w;
	cin>>w;
	printf("%d\n",w*32);
	return 0;
}

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

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

}

C++: //============================================================================
// Name        : JOI.cpp
// Author      :
// Version     :
// Copyright   : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

int N;

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



	return 0;
}

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

#define int long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
typedef vector<int>vint;
typedef pair<int,int>pint;
typedef vector<pint>vpint;
#define fi first
#define se second
template<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}
template<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}

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

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

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