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++: #define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>

using namespace std;
using ll = long long;
// #define int ll
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define PB push_back

const ll LLINF = (1LL<<60);
const int INF = (1LL<<30);
const int MOD = 1000000007;

template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template <typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }
template<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }
template<class S,class T>
ostream &operator <<(ostream& out,const pair<S,T>& a){
  out<<'('<<a.first<<','<<a.second<<')';
  return out;
}
template<class T>
ostream &operator <<(ostream& out,const vector<T>& a){
  out<<'[';
  REP(i, a.size()) {out<<a[i];if(i!=a.size()-1)out<<',';}
  out<<']';
  return out;
}

int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};

#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/tag_and_trait.hpp>
using namespace __gnu_pbds;
using btree = tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>;

// xx, yy, zzにそれぞれ座圧する元の配列を突っ込むとx, y, zが座圧された配列で返ってくる
// zip[座圧前] = 座圧後、unzip[座圧後] = 座圧前
vector<ll> xx, x, unzip(100010);
unordered_map<ll, ll> zip;
void compress() {
  x = xx;
  // cout << xx << endl;
  sort(ALL(xx));
  xx.erase(unique(ALL(xx)), xx.end());
  // cout << xx << endl;
  reverse(ALL(xx));
  REP(i, xx.size()) {zip[xx[i]] = i; unzip[i] = xx[i];}
  REP(i, x.size()) x[i] = zip[x[i]];
}

// Binary Indexed Tree
// 0-indexed
template <typename T>
class BIT {
private:
  // データ
  vector<T> bit;
  // 単位元, 要素数
  int neutral = 0;
  // 更新クエリ, 区間クエリ
  function<T(T,T)> f = [](const T l, const T r) -> T { return l+r; },
                   g = [](const T l, const T r) -> T { return l+r; };
public:
  // 初期化
  BIT(int n_ = 1e5) { init(n_); }
  void init(int n_ = 1e5) { bit.assign(n_+1, neutral); }
  // iに対する点更新クエリ
  void update(int i, T w) {
    for(int x = i+1; x < (int)bit.size(); x += x&-x) bit[x] = f(bit[x], w);
  }
  // [0,i)に対する区間クエリ
  T query(int i) {
    T ret = neutral;
    for(int x = i+1; x > 0; x -= x & -x) ret = g(ret, bit[x]);
    return ret;
  }
  // 合計がw以上の最小の位置 ToDo:verify
  int lower_bound(T w) {
    if(w <= 0) return 0;
    int curr = 1; while(curr <= (int)bit.size()-1) curr <<= 1;
    int x = 0;
    for(int k=curr; k>0; k>>=1) {
      if(x+k <= (int)bit.size() && bit[x+k] < w) {
        w -= bit[x+k];
        x += k;
      }
    }
    return x;
  }
};

btree se[100010];
ll type[100010], t[100010], p[100010], pre[100010], sc[100010], m[100010];
signed main(void)
{
  cin.tie(0);
  ios::sync_with_stdio(false);

  int n, c;
  cin >> n >> c;
  REP(i, c) {
    cin >> type[i];
    if(type[i] == 0) {
      cin >> t[i] >> p[i];
      pre[i] = sc[t[i]];
      p[i] += pre[i];
      sc[t[i]] = p[i];
      xx.PB(sc[t[i]]);
    } else {
      cin >> m[i];
    }
  }

  xx.PB(0);
  compress();

  // cout << xx.size() << endl;

  BIT<int> bit(xx.size());
  bit.update(xx.size()-1, n);
  FOR(i, 1, n+1) se[xx.size()-1].insert(i);

  // REP(j, xx.size()+1) cout << se[j].size() << " ";
  // cout << endl;

  // cout << unzip << endl;

  REP(i, c) {
    if(type[i] == 0) {
      // 座圧
      // cout << "(" << t[i] << "," << pre[i] << "," << p[i] << ")" << endl;
      p[i] = zip[p[i]];
      pre[i] = zip[pre[i]];
      // bitに処理
      bit.update(pre[i], -1);
      bit.update(p[i], 1);
      // pb_dsに処理
      se[pre[i]].erase(t[i]);
      se[p[i]].insert(t[i]);
    } else {
      int point = bit.lower_bound(m[i]);
      // point-1 までの累積和
      int sum = point==0 ? 0 : bit.query(point-1);
      // cout << point << " " << sum << endl;
      // 平衡二分探索木se[point] で m[i] - sum 番目 のチーム番号
      auto itr = se[point].find_by_order(m[i]-sum-1);
      cout << *itr << " " << unzip[point] << endl;
    }
    // REP(j, xx.size()) cout << se[j].size() << " ";
    // cout << endl;
  }

  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<int, int>;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(x) (x).begin(),(x).end()
#define MAX(x) *max_element(ALL(x))
#define SIZE(x) ((ll)(x).size())
#define INF 1000000000000

int gcd(int a,int b){return b?gcd(b,a%b):a;}
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};

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

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

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

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

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

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

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 <iostream>
using namespace std;

int main()
{

  int h,r;

  cin >> h >> r;

  if(h > 0 && r <= h)
    {
      cout << 1 << endl;
    }
  if(h < 0 && r < h*(-1))
    {
      cout << -1 << endl;
    }
  if(h < 0 && h*(-1) == r)
    {
      cout << 0 << endl;
    }
  if(h == 0)
    {
      cout << 1 << endl;
    }
  if(h < 0 && r > h)
    {
      cout << 1 << endl;
    }
  if(h > 0 && r > h)
    {
      cout << 1 << endl;
    }
}

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

using namespace std;

//#define int long long
#define FOR(i, j, k) for(int i = j; i < (int)k; ++i)
#define rep(i, j) FOR(i, 0, j)
#define INF (1 << 30)

typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<P, int> Pi;

const int MOD = 1e9 + 7;
const int dy[] = {0, 0, 1, -1};
const int dx[] = {1, -1, 0, 0};

template <class T> void chmin(T& a, const T& b) { a = min(a, b); }
template <class T> void chmax(T& a, const T& b) { a = max(a, b); }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

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

    int n;
    cin >> n;
    cout << n * 32 << endl;
    return 0;
}