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 int long long
#define rep(i, n) for(int i = 0; i < n; i++)
#define all(a) a.begin(), a.end()
#define mod 1000000007
#define MOD 998244353
#define INF 40000000000000000
int dx8[8] = {-1, 0, 1, 1, 1, 0, -1, -1};
int dy8[8] = {1, 1, 1, 0, -1, -1, -1, 0};
int dx4[4] = {-1, 0, 1, 0};
int dy4[4] = {0, -1, 0, 1};
template <class T>
inline bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
inline bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return 1;
    }
    return 0;
}
int sum(int n){
    int res=0;
    while(n>0){
        res+=n%10;
        n/=10;
    }
    return res;
}
int gcd(int a,int b){
    if(b==0)return a;
    return gcd(b,a%b);
}
signed main() {
    int n;cin>>n;
    cout<<n*32<<endl;
}

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

C++: #include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <iomanip>
#include <stdlib.h>
#include <string.h>
#include <cmath>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <set>
const long long MOD = 1000000007;
using namespace std;
typedef long long ll;
map<ll, int> mp;
signed main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	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;
}

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

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

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

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

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

	      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(void) {
  int w;
  cin >> w;
  cout << 32*w << endl;
}

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(){
    int n;
    scanf("%d",&n);
    printf("%d\n",32*n);
}

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(void){
    int w;
    cin >>w;
    
    cout << 32*w <<endl;
    
}

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 W;
int main(){
cin>>W;
cout<<32*W<<endl;


return 0;
}

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

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

#define pb push_back
#define rep(i, a, n) for(int i = (a); i < (n); i++)
#define dep(i, a, n) for(int i = (a); i >= (n); i--)
#define mod 1e9+7

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

int gcd(int a, int b ) {
  if(a == 0) return b;
  return gcd(b % a, a);
}

bool isPrime(int a) {
  if(a == 2) return true;
  if(a < 2 || !(a % 2)) return false;

  double sq = sqrt(num);
  for(int i = 3; i <= sq; i += 2) {
    if(a % i == 0) return false;
  }
  return true;
}


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<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(){
	int W;
	cin>>W;
	cout<<W*32<<endl;
	return 0;
}

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

C++: #include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
const ld eps = 1e-9;

//// < "d:\d_download\visual studio 2015\projects\programing_contest_c++\debug\a.txt" > "d:\d_download\visual studio 2015\projects\programing_contest_c++\debug\b.txt"


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

C++: #include <bits/stdc++.h>
using namespace std;
#define ROUNDUP(divisor,dividend) (divisor + (dividend - 1)) / dividend
int w;
int main(){
  cin >> w;
  cout << w*32 << endl;
}

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

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

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

C++: #include<cstdio>

int main(void){
    int word=0;
    scanf("%d",&word);
    printf("%d\n",word*32);
    return 0;
}

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

C++: #include <bits/stdc++.h>
#define int long long
#define double long double
#define INF 1e18
using namespace std;
template<class T> inline bool chmin(T& a, T b) {
  if (a > b) a = b;
  return a > b;
}
template<class T> inline bool chmax(T&a, T b) {
  if (a < b) a = b;
  return a < b;
}

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

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

C++: #include <bits/stdc++.h>
#define all(vec) vec.begin(), vec.end()
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
constexpr ll INF = (1LL << 30) - 1LL;
constexpr ll LINF = (1LL << 60) - 1LL;
constexpr double eps = 1e-9;
constexpr ll MOD = 1000000007LL;
template <typename T> bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
};
template <typename T> bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
};
template <typename T> ostream &operator<<(ostream &os, vector<T> v) {
    for (int i = 0; i < v.size(); i++) {
        os << v[i] << (i + 1 == v.size() ? "\n" : " ");
    }
    return os;
}
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
    return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
    t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
    for (auto &e : t) {
        fill_v(e, v);
    }
};
int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int w;
    cin >> w;
    cout << 32 * w << endl;
}

C++: #include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<string>
#include<cassert>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
signed main() {
	int w; cin >> w; cout << w * 32 << endl;
}

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

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

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


}

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

C++: #include <iostream>
using namespace std;
signed main(){
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    int w;
    cin>>w;
    cout<<w*32<<"\n";
    return 0;
}

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

using namespace std;
int main(){
long long w;
cin>>w;
cout<<w*32<<endl;


}