akhauriyash/Code-Regression huggingface dataset:
#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <math.h>
#include <stdio.h>
#include <iomanip>
#include <limits>
#include <list>
#include <string>
#include <queue>
#include <deque>
#include <tuple>
#include <map>
#include <sstream>
using namespace std;
#define MOD (long long int)(1e9+7)
#define ll long long int
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define reps(i,n) for(int i=1; i<=(int)(n); i++)
#define REP(i,n) for(int i=n-1; i>=0; i--)
#define REPS(i,n) for(int i=n; i>0; i--)
#define FOR(i,a,b) for(int i=a; i<(int)(b); i++)
#define ALL(x) (x).begin(),(x).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define SORT(c) sort(ALL(x))
#define CLR(a) memset((a), 0 ,sizeof(a))
#define PB push_back
#define MP make_pair
#define SP << " " <<
const int INF = 1001001001;
const ll LINF = 100100100100100100;
const double EPS = 1e-10;
const long double PI  = acos(-1.0L);
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
#define chmax(a,b) a = (((a)<(b))?(b):(a))
#define chmin(a,b) a = (((a)>(b))?(b):(a))

__attribute__((constructor))
void initial(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	cout << fixed << setprecision(15);
}

signed main(){
	int a,b; cin>>a>>b;
	reps(i,3){
		if(i!=a&&i!=b) cout << i << endl;
	}


  return 0;
}


Measured memory_bytes: 256
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <string>
#include <bitset>
 
using namespace std;
typedef long long ll;

#define pb push_back
#define fe first
#define se second
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound

template <typename A, typename B>
string to_string(pair<A, B> p);
 
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
 
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
 
string to_string(const string& s) {
  return '"' + s + '"';
}
 
string to_string(const char* s) {
  return to_string((string) s);
}
 
string to_string(bool b) {
  return (b ? "true" : "false");
}
 
string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}
 
template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}
 
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
 
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
 
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
 
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
 
void debug_out() { cerr << endl; }
 
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
 
#ifdef __APPLE__
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define dbg(...) 42
#endif
 
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);

    int n;
    string s;
    cin >> n >> s;
    vector<int>ws,rs;
    for(int i = 0; i<n; ++i){
        if(s[i]=='W') ws.pb(i);
        else rs.pb(i);
    }
    int w= 0,r=rs.size()-1,ans=0;
    while(w<ws.size()&&r>=0&&ws[w]<rs[r]){
        ++ans,++w,--r;
    }
    cout << ans;
}

Measured memory_bytes: 4200
use std::io::*;
use std::str::FromStr;

fn main() {
    let (a, b): (i32, i32) = (read(), read());
    println!(
        "{}",
        if a % 2 != 0 && b % 2 != 0 {
            "Yes"
        } else {
            "No"
        }
    );
}

fn read<T: FromStr>() -> T {
    let stdin = stdin();
    let stdin = stdin.lock();
    let token: String = stdin
        .bytes()
        .map(|c| c.expect("failed to read char") as char)
        .skip_while(|c| c.is_whitespace())
        .take_while(|c| !c.is_whitespace())
        .collect();
    token.parse().ok().expect("failed to parse token")
}


Measured memory_bytes: 4352
package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

var sc = bufio.NewScanner(os.Stdin)

func Scanner() string {
	sc.Scan()
	return sc.Text()
}

func intScanner() int {
	n, _ := strconv.Atoi(Scanner())
	return n
}

var mod int

func main() {
	mod = 1000000007
	buf := make([]byte, 0)
	sc.Buffer(buf, mod)
	sc.Split(bufio.ScanWords)
	n := intScanner()
	m := intScanner()
	x := 1 << uint(n)
	as := make([]int, m)
	ks := make([]int, m)
	for i := 0; i < m; i++ {
		k := 0
		as[i] = intScanner()
		b := intScanner()
		for j := 0; j < b; j++ {
			k += 1 << uint(intScanner()-1)
		}
		ks[i] = k
	}
	dp := make([][]int, m+1)
	for i := 0; i < m+1; i++ {
		dp[i] = make([]int, x)
		for j := 1; j < x; j++ {
			dp[i][j] = mod
		}
	}
	for i := 1; i < m+1; i++ {
		for j := 0; j < x; j++ {
			dp[i][j] = dp[i-1][j]
		}
		for j := 0; j < x; j++ {
			next := j | ks[i-1]
			dp[i][next] = smaller(dp[i][next], dp[i-1][j]+as[i-1])
		}
	}
	if dp[m][x-1] == mod {
		fmt.Println(-1)
	} else {
		fmt.Println(dp[m][x-1])
	}
}
func smaller(x, y int) int {
	if x < y {
		return x
	} else {
		return y
	}
}


Measured memory_bytes: 33920
#include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;

using ll = long long;

class Stream{
public:
    Stream(){

    }
    //配列以外の入力を受け取る
    void read(){

    }
    template<typename First, typename... Rest>
    void read(First& first, Rest&... rest){
        cin >> first;
        read(rest...);
    }
    //配列を区切って出力する
    template<typename T>
    void write_vec(vector<T>& v, char divider){
        for(size_t i = 0; i < v.size(); i++){
            cout << v[i] << divider;
        }
    }
};

int main(){
    Stream io;
    
    int N;
    io.read(N);
    vector<ll> T(N);
    for(int i = 0; i < N; i++){
        io.read(T[i]);
    }
    ll l = T[0];
    for(int i = 1; i < N; i++){
        l = (l / __gcd(l, T[i])) * T[i];
    }
    cout << l;
    return 0;
}

Measured memory_bytes: 256
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <functional>
#include <algorithm>

using namespace std;

#define rep(i,j) REP((i), 0, (j))
#define REP(i,j,k) for(int i=(j);(i)<(k);++i)
#define BW(a,x,b) ((a)<=(x)&&(x)<=(b))
#define ALL(v) (v).begin(), (v).end()
#define LENGTHOF(x) (sizeof(x) / sizeof(*(x)))
#define AFILL(a, b) fill((int*)a, (int*)(a + LENGTHOF(a)), b)
#define SQ(x) ((x)*(x))
#define Mod(x, mod) (((x)+(mod)%(mod))
#define MP make_pair
#define PB push_back
#define Fi first
#define Se second
#define INF (1<<29)
#define EPS 1e-10
#define MOD 1000000007

typedef pair<int, int> pi;
typedef pair<int, pi> pii;
typedef vector<int> vi;
typedef queue<int> qi;
typedef long long ll;

int N,M,C,s,g;
int dist[32][128][128], p[32], q[32][64], r[32][64];
int cost[128][128], fare[32][20010];

int solve(){
  rep(c,C) rep(k,N) rep(i,N) rep(j,N) dist[c][i][j] = min(dist[c][i][j], dist[c][i][k]+dist[c][k][j]);
  rep(c,C) rep(i,N) rep(j,N) if(dist[c][i][j] < INF) cost[i][j] = min(cost[i][j],fare[c][dist[c][i][j]]);
  rep(k,N) rep(i,N) rep(j,N) cost[i][j] = min(cost[i][j], cost[i][k]+cost[k][j]);
  return cost[s][g]==INF?-1:cost[s][g];
}

int main(){
  while(scanf("%d%d%d%d%d",&N,&M,&C,&s,&g) && N||M||C||s||g){
    rep(i,32)rep(j,128)rep(k,128) dist[i][j][k]=INF;
    rep(i,128)rep(j,128) cost[i][j]=INF;
    s--; g--;
    rep(i,M){
      int x,y,d,c;
      scanf("%d%d%d%d",&x,&y,&d,&c); x--; y--; c--;
      dist[c][x][y] = dist[c][y][x] = min(dist[c][y][x], d);
    }
    rep(i,C) scanf("%d", p+i);
    rep(i,C){
      rep(j,p[i]-1) scanf("%d", &q[i][j]);
      rep(j,p[i]) scanf("%d", &r[i][j]);
      q[i][p[i]-1] = INF;
      int pos = 0;
      fare[i][0] = 0;
      for(int k=1;k<20010;k++){
	if(q[i][pos] < k) pos++;
	fare[i][k] = fare[i][k-1] + r[i][pos];
      }
    }

    printf("%d\n",solve());
  }
  return 0;
}

Measured memory_bytes: 5336
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cout << #x << ": " << x << endl
#define repn(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(i, a) for(int i = 0; i < (int)(a); i++)
#define all(v) v.begin(), v.end() 
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define endl '\n'

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

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	//freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
	char b;
	cin >> b;
	if(b == 'A') cout << 'T' << endl;
	if(b == 'T') cout << 'A' << endl;
	if(b == 'C') cout << 'G' << endl;
	if(b == 'G') cout << 'C' << endl;
	return 0;
}
/*
Things to look out for:
	- Integer overflows
	- Array bounds
	- Special cases
Be careful!
*/


Measured memory_bytes: 256
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define rep(i,n) for(int i=0;i<n;i++)
#define mod 1000000007 // 10^9+7
#define INF 99999999999 //10^12-1
#define dev 998244353 //tenka1
#define P pair<int,int>
#define F first
#define S second
int w,h,ans=0;
char c[4000][4000];
int l[4000][4000],r[4000][4000];
int u[4000][4000],d[4000][4000];
signed main(){
    cin>>h>>w;
    rep(i,h){
        rep(j,w){
            cin>>c[i][j];
        }
    }
    rep(i,h){
        rep(j,w){
            if(c[i][j]=='#')continue;
            if(j==0)l[i][j]=1;
            else l[i][j]=l[i][j-1]+1;
        }
    }
    rep(i,h){
        for(int j=w-1;j>=0;j--){
            if(c[i][j]=='#')continue;
            if(j==w-1)r[i][j]=1;
            else r[i][j]=r[i][j+1]+1;
        }
    }
    rep(i,w){
        rep(j,h){
            if(c[j][i]=='#')continue;
            if(j==0)u[j][i]=1;
            else u[j][i]=u[j-1][i]+1;
        }
    }
    rep(i,w){
        for(int j=h-1;j>=0;j--){
            if(c[j][i]=='#')continue;
            if(j==h-1)d[j][i]=1;
            else d[j][i]=d[j+1][i]+1;
        }
    }
    rep(i,h){
        rep(j,w){
            ans=max(ans,u[i][j]+d[i][j]+l[i][j]+r[i][j]-3);
        }
    }
    cout<<ans<<endl;
    return 0;
}



Measured memory_bytes: 261632
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#include <iomanip>
#include <complex>
#include <bitset>
#include <stack>
using namespace std;
 
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define repl(i,s,n) for(int i=s; i<=n; ++i)
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define ktya(x) sort(all(x))
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 1e18
#define INFLL 1000000000000000007LL
#define SIZE 200105
#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
#define mind(a,b) (a>b?b:a)
#define maxd(a,b) (a>b?a:b)
#define PI (acos(-1))
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
typedef pair<int,ll> pill; typedef pair<ll,int> plli; 
typedef pair<double, int> pdi;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }
typedef complex<double> P;
//ll MOD = 1000000007;
ll MOD=998244353;
typedef ll Weight;
struct Edge {
	int src, dst;
	Weight weight;
};
bool operator < (const Edge &e, const Edge &f) {
	return e.weight != f.weight ? e.weight > f.weight : // !!INVERSE!!
	e.src != f.src ? e.src < f.src : e.dst < f.dst;
}
typedef vector<Edge> Edges;
int N;
vector<ll> A,B;
bool check[214514];

int main(){
	cin>>N;
	rep(i,N){
		check[i]=false;
	}
	rep(i,N){
		ll x;
		cin>>x;
		A.pb(x);
	}
	priority_queue<plli> que;
	rep(i,N){
		ll x;
		cin>>x;
		B.pb(x);
		if(A[i]==B[i])check[i]=true;
		else{
			que.push(mp(B[i],i));
		}
	}
	ll ans=0;
	while(!que.empty()){
		pill hoge=que.top();
		int num=hoge.second;
		ll cos=hoge.first;
		ll wa = B[(num+1)%N]+B[(num+N-1)%N];
		que.pop();
		if((cos-A[num])%wa==0){
			ans+=(cos-A[num])/wa;
			check[num]=true;
			B[num]=A[num];
		}else{
			ll nex=cos%wa;
			ans+=cos/wa;
			
			if(nex==cos)break;
			else if(A[num]>nex)break;
			else{
				B[num]=nex;
				que.push(mp(nex,num));
			}
		}
	}
	bool bigflag=true;
	rep(i,N)if(!check[i])bigflag=false;
	if(bigflag){
		cout<<ans<<endl;
	}else{
		cout<<-1<<endl;
	}
}

Measured memory_bytes: 11504
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<int(n);++i)
int main(void){
    rep(i,3){
        string s;
        cin>>s;
        cout<<char(s[0]+'A'-'a');
    }
    cout<<endl;
    return 0;
}


Measured memory_bytes: 256
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
using namespace std;
typedef long long int ll;

int main(){
    int n; cin >> n;
    set<ll> prime;
    vector<int> a(n);
    for(int i=0;i<n;i++){
        cin >> a[i];
        int cp=a[i];
        for(int j=2;j*j<=a[i];j++){
            if(cp%j!=0)continue;
            else{
                while(cp%j==0){
                    cp/=j;
                }
                prime.insert(j);
            }
        }
        if(cp!=1)prime.insert(cp);
    }
    ll ans=0;
    for(auto s:prime){
        ll cnt=0;
        for(int i=0;i<n;i++){
            if(a[i]%s==0)cnt+=a[i];
        }
        ans=max(ans,cnt);
    }
    cout << ans << endl;
}


Measured memory_bytes: 3116
#include<iostream>
#include <algorithm>
#include<string>
#include <numeric>
#include<math.h>
#include <bits/stdc++.h>
using namespace std;

int main() {
    int a,b,c;
    cin>>a>>b>>c;
    if(a*c<=b)cout<<c<<endl;
    else cout<<b/a<<endl;
    return 0;
}


Measured memory_bytes: 256
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <iomanip>
#include <map>
#include <set>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <iterator>
#include <string>
#include <limits>

using namespace std;

using i64 = int64_t;
using P = pair<i64, i64>;
i64 mod = 1000000007;
//i64 mod = 998244353;
int int_max = 2147483647;
i64 INF = 1e16;
int max_n = 1e5;

i64 find_farest(vector<P>& v, i64 pos, i64& maxd) {
    i64 ret=pos;
    maxd =0;
    P& p0 = v[pos];
    for (i64 i=0; i<v.size(); ++i) {
        P& p = v[i];
        i64 dis = abs(p.first-p0.first) + abs(p.second-p0.second);
        if (dis > maxd) {
            maxd = dis;
            ret = i;
        }
    }
    return ret;
}

int main(int argc, char **argv) {
    i64 n;
    cin >> n;

    vector<P> v(n);
    vector<i64> maxs{int_max, 0, int_max, 0, int_max, 0, 0, 0}, max_pos(8, 0);
    for (int i=0; i<n; ++i) {
        i64 x, y;
        cin >> x >> y;
        v[i] = make_pair(x,y);

        if (maxs[0] > x) {
            maxs[0]=x;
            max_pos[0]=i;
        }
        if (maxs[1] < x) {
            maxs[1]=x;
            max_pos[1]=i;
        }
        if (maxs[2] > y) {
            maxs[2]=y;
            max_pos[2]=i;
        }
        if (maxs[3] < y) {
            maxs[3]=y;
            max_pos[3]=i;
        }
        if (maxs[4] > abs(x)+abs(y)) {
            maxs[4] = abs(x)+abs(y);
            max_pos[4]=i;
        }
        if (maxs[5] < abs(x)+abs(y)) {
            maxs[5] = abs(x)+abs(y);
            max_pos[5]=i;
        }
        if (x>=y && x-y > maxs[6]) {
            maxs[6] = x-y;
            max_pos[6] = i;
        }
        if (x<=y && y-x > maxs[7]) {
            maxs[7] = y-x;
            max_pos[7] = i;
        }
    }

    i64 maxmax{0};
    for (i64 i=0; i<max_pos.size(); ++i) {
        i64 maxd{0};
        i64 pos = max_pos[i], old_pos = max_pos[i];
        while (true) {
            i64 new_pos = find_farest(v, pos, maxd);
            if (new_pos == old_pos) break;
            old_pos = pos;
            pos = new_pos;
        }
        maxmax = max(maxd, maxmax);
    }

    cout << maxmax << endl;

    return 0;
}

Measured memory_bytes: 6332
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define PI 3.141592653589793
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, a, n) for (int i = a; i < (n); i++)
#define rrep(i, n, k) for (int i = (n); i >= (k); i--);
#define all(x) (x).begin(), (x).end()
#define vi vector<int>
#define pi pair<int, int>
#define pl pair<ll, ll>
template<class T> istream &operator>>(istream&is,vector<T>&v){for(auto &elemnt:v)is>>elemnt;return is;}
template<class T,class U> istream &operator>>(istream&is,pair<T,U>&p){is>>p.first>>p.second;return is;}
template<class T>vector<T> make_vector(size_t a){return vector<T>(a);}
template<class T, class... Ts>auto make_vector(size_t a, Ts... ts){return vector<decltype(make_vector<T>(ts...))>(a, make_vector<T>(ts...));}
const int MOD = 1e9+ 7;
const int INF = numeric_limits<int>::max() - 1e8;
const ll INFLL = numeric_limits<ll>::max() - 1e17;

int main() {
    int N;
    cin >> N;
    vector<int> a(N + 1);
    for (int i = 1; i <= N; i++) cin >> a[i];
    int ans = 0;
    for (int i = 1; i <= N; i++) {
        int next = a[i];
        if (next <= i) continue;
        if (a[next] == i) ans++;
    }
    cout << ans << endl;
}

Measured memory_bytes: 640
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
d = [a[0], b[0], c[0]]
e = [a[1], b[1], c[1]]
f = [a[2], b[2], c[2]]
g = [a[0], b[1], c[2]]
h = [a[2], b[1], c[0]]

n = int(input())

bs = []
for _ in range(n):
    bs.append(int(input()))

for l in [a, b, c, d, e, f, g, h]:
    if (l[0] in bs) and (l[1] in bs) and (l[2] in bs):
        print("Yes")
        break
else:
    print("No")

Measured memory_bytes: 3064
#include <bits/stdc++.h>
using namespace std;
 
int main(){
  string S;
  cin >> S;

  char c;
  int i;
  int cnt = 0;

  for (c = 'a'; c <= 'z'; c++){
    bool status = false;

    for (i = 0; i < S.size(); i++){
      if(c == S.at(i)){
        status = true;
        break;
      }
    }

    if (status && c < 'z')continue;
    else if (status && c == 'z'){
      cout << "None" << endl;
    } else {
      cout << c << endl;
      break;
    }
  }

}

Measured memory_bytes: 512
using System;
using System.Linq;

namespace _1153
{
    class Program
    {
        static void Main(string[] args)
        {
            while (true)
            {
                int[] x = Console.ReadLine().Split().Select(int.Parse).ToArray();
                if (x.Max() == 0) break;
                int[] taro = new int[x[0]];
                for (int i = 0; i < x[0]; i++) taro[i] = int.Parse(Console.ReadLine());
                int[] hanako = new int[x[1]];
                for (int i = 0; i < x[1]; i++) hanako[i] = int.Parse(Console.ReadLine());
                int[] ret = new int[] { -1,-1 }; int minpoint = int.MaxValue;
                for (int i = 0; i < x[0]; i++)
                {
                    for (int j = 0; j < x[1]; j++)
                    {
                        if (taro.Sum() - taro[i] + hanako[j] == hanako.Sum() + taro[i] - hanako[j])
                        {
                            if (minpoint > taro[i] + hanako[j])
                            {
                                minpoint = taro[i] + hanako[j];
                                ret[0] = taro[i];
                                ret[1] = hanako[j];
                            }
                        }
                    }
                }
                Console.WriteLine(ret[0] != -1 ? ret[0] + " " + ret[1] : "-1");
            }
        }
    }
}


Measured memory_bytes: 9640
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int a = sc.nextInt();
		int b = sc.nextInt();
		int area = a * b;
		int length = 2 * (a + b);
		System.out.println(area + " " + length);
		sc.close();
	}
}


Measured memory_bytes: 26336
#include <iostream>
#include <stdio.h>

using namespace std;

int dividir(int* num){
    int resto = *num % 10;
    *num = *num / 10;
    return resto;
}

int main()
{
    int n, aux, soma=0;
    
    cin >> n;
    
    aux = n;
    
    while (aux != 0){
        soma += dividir(&aux);
    }
    
    if (n%soma==0)
        cout << "Yes\n";
    else
        cout << "No\n";
    
    return 0;
}

Measured memory_bytes: 256
#include <bits/stdc++.h> 
 
using namespace std; 
 


int main() 
{
    int a,b,c;
    cin >> a >> b >> c;
    
    
    if(a<b && b<c)
      cout << "Yes" << endl;
    else
      cout << "No" << endl;
      
    return 0;
}


Measured memory_bytes: 3088
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii =  pair<int, int>;
using pll =  pair<long long, long long>;
constexpr char ln =  '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000009LL;
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define fo(i,j,n) for (int i=(j); i < (n); i++)
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 main() { 
    ll l, r; cin >> l >> r;
    ll res = INF;
    if(r - l > 2018) res = 0;
    else{
        for(ll i=l; i<r; i++){
            for(ll j=i+1; j<=r; j++){
                chmin(res, i*j%2019);
            }
        }
    }
    cout << res << ln;
}

Measured memory_bytes: 256
#include <bits/stdc++.h>
#define SIZE 300005
#define MOD 1000000007LL
#define EPS 1e-10
#define INF 2147483647
#define LLINF 9223372036854775807
#define REP(i,n) for(int i=0;i<n;i++)
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define DOWN(i,b,a) for(int i=b;i>=a;i--)
#define SET(a,c) memset(a,c,sizeof a)
#define BIT(i,j) ((i)>>(j))&1
#define ALL(o) (o).begin(), (o).end()
#define ERASE(o) (o).erase(unique((o).begin(),(o).end()), (o).end())
#define SQ(x) ((x)*(x))
using namespace std;
typedef long long ll;
typedef pair<ll,ll> Pll;
typedef pair<int, int> Pii;
typedef pair<double, double> Pdd;
typedef complex<double> dcomplex;
template<typename T> inline void priv(vector<T>a){REP(i,a.size()){cerr<<a[i]<<((i==a.size()-1)?"\n":" ");}}
ll gcd(ll a,ll b){int c=max(a,b);int d=min(a,b);return c==0||d==0?c:gcd(c%d,d);}
ll lcm(ll a,ll b){return a==0||b==0?0:a*b/gcd(a,b);}
ll modfact(ll a){ll b=1;FOR(i,2,a)b=b*i%MOD;return b;}
ll modpow(ll a, ll n){ll b=1;while (n>0){if(n&1)b=b*a%MOD;a=a*a%MOD;n>>=1;}return b;}
ll modcomb(ll n, ll k){ll b=1;k=min(n-k,k);DOWN(i,n,n-k+1)b=b*i%MOD;return b*modpow(modfact(k),MOD-2)%MOD;}

ll N, a;
vector<vector<ll>> A;

ll count(ll x) {
    if(A[x].size()==0) return 0;
    vector<ll> tmp(A[x].size());
    REP(i, tmp.size())
        tmp[i] = count(A[x][i]);
    sort(ALL(tmp));
    reverse(ALL(tmp));
    ll ans = 0;
    REP(i, tmp.size())
        ans = max(tmp[i]+i+1, ans);
    return ans;
}

int main() {
    cin >> N;
    A.resize(N, vector<ll>(0));
    REP(i, N-1) {
       cin >> a;
       a--;
       A[a].push_back(i+1);
    }
    cout << count(0) << endl;
	return 0;
}

Measured memory_bytes: 16640
# -*- coding: utf-8 -*-

import sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

S=input()

print(S.count('1'))


Measured memory_bytes: 3064
#pragma GCC optimize ("O3")
#include<bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <queue>
#include <set>
#include <string>
#include <stdbool.h>
#include<ctime>

#include <cstring>

#define pb push_back
#define p push

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define ll long long

#define getI(a) scanf("%d",&a)
#define getII(a, b) scanf("%d%d",&a,&b)
#define getIII(a, b, c) scanf("%d%d%d",&a,&b,&c)
#define getL(a) scanf("%lld",&a)
#define getLL(a, b) scanf("%lld%lld",&a,&b)
#define getLLL(a, b, c) scanf("%lld%lld%lld",&a,&b,&c)
#define BEND(c) (c).begin(),(c).end()
#define BEND2(c) (c).rbegin(),(c).rend()
#define fi first
#define se second
#define pi 3.1415926535897932384626
#define getS(a) scanf("%s",a)
#define pfb(a) printf("%.10lf\n",a);
#define pfi(a) printf("%d",a);
#define pfii(a, b) printf("%d%d",a,b);
#define pfl(a) printf("%lld",a);
#define pfll(a, b) printf("%lld%lld",a,b);
#define pfd(a) printf("%.12lf ",a);
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);
#define endl "\n"

#define MOD  ( int)(1e9 + 7)
#define MAXN (ll) ((1e6+5))
#define K 25
#define  ALPHABET_SIZE  26
//#define N (int)(1e5+10)
#define sag (sol|1)
#define sol (root<<1)
#define ort (bas+son)/2
#define INF (ll )1e18
#define int ll
using namespace std;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<vector<pair<int, int>>> vvpi;
typedef vector<long long> vl;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<long long, long long>> vpl;
typedef pair<int, int> pii;
typedef pair <ll, ll> pll;
typedef vector<vi> graph;


signed main(){
	IOS;

	ll n; 
	cin >> n;
	ll res = 0;
	for (int i = 1; i  <= n; i++){
		for (int j = i; j <= n; j++){
			for (int t = j; t <= n; t++){
			    //cout << i << j<<t<<"-";
				int carpan = 1;
				if (i == j and j == t)carpan = 1;
				else if ((i == j and j != t) or(i == t and j != t) or(t == j and i != t))carpan = 3;
				else carpan = 6;
				ll temp = __gcd(__gcd(i , j ), t) ;
				temp *= carpan;
				res += temp;
			//	cout << temp<<endl;
			}
		}
	}
	cout << res;

	return 0;
}

Measured memory_bytes: 3636
#include <bits/stdc++.h>
using namespace std;

int main() {
    string a, b;
    cin >> a >> b;

    if (a.length() > b.length()) {
        cout << "GREATER" << endl;
    } else if (a.length() < b.length()) {
        cout << "LESS" << endl;
    } else {
        bool equal = true;
        for (int i = 0; i < a.length(); i++) {
            if (a.at(i) > b.at(i)) {
                cout << "GREATER" << endl;
                equal = false;
                break;
            } else if (a.at(i) < b.at(i)) {
                cout << "LESS" << endl;
                equal = false;
                break;
            } else {
                continue;
            }
        }
        if (equal) {
            cout << "EQUAL" << endl;
        }
    }
}

Measured memory_bytes: 256
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <cwchar>
#include <cwctype>
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <array>
#include <atomic>
#include <chrono>
#include <codecvt>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
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; }
#define all(x) (x).begin(),(x).end()
#pragma GCC optimize("Ofast")
using namespace std;
typedef int64_t ll;
typedef long double ld;
const ll INF=(1LL<<60);
const ld pi=acosl((ld)1);
const ll mod = 1000000007;
const int dx[4]={0,1,0,-1};
const int dy[4]={1,0,-1,0};
const int ddx[8]={1,0,-1,-1,-1,0,1,1};
const int ddy[8]={1,1,1,0,-1,-1,-1,0};
#define endn "\n"

ll f(ll n){
    if(n==0)return INF;
    ll ret=0;
    while(n%2==0){
        n/=2;
        ret++;
    }
    return ret;
}

char rf(int n){
    if(n<26)return ('A'+n);
    else return ('a'+(n-26));
}

bool solve(){
    ll x,y;cin>>x>>y;
    ll ans=INF;
    //反転させる

        chmin(ans,abs(-x-y)+1);

    //2回反転させる
        chmin(ans,abs(x-y)+2);

    //そのまま
    if(x<=y)chmin(ans,abs(x-y));


    cout<<ans<<endl;
    return false;
}

signed main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout<<fixed;
	cout<<setprecision(30);
	return solve();
}


Measured memory_bytes: 256
#include <bits/stdc++.h>
#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 ll long long
#define lld long double
#define ALL(x) x.begin(), x.end()
#define chmin(x, y) x = min(x, y);
using namespace std;

const int IINF = 1 << 30;
const ll INF = 1ll << 60;
const ll MOD = 1e9 + 7;

int main(int argc, char const *argv[])
{
    int n, a;
    cin >> n >> a;
    vector<int> v(n);
    rep(i, n) cin >> v[i];
    vector<vector<ll>> dp(n + 1, vector<ll>(2525, 0));
    dp[0][0] = 1;
    rep(i, n)
    {
        auto next = dp;
        rep(j, 1, n + 1)
        {
            rep(k, 2525)
            {
                if (k - v[i] >= 0)
                {
                    next[j][k] += dp[j - 1][k - v[i]];
                }
            }
        }
        dp = next;
    }
    ll ans = 0;
    rep(i, 1, n + 1)
    {
        if (a * i >= 2525)
            break;
        ans += dp[i][a * i];
    }
    cout << ans << endl;
    return 0;
}


Measured memory_bytes: 2336
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <numeric>  // min, max
#include <fstream>  // ifstream
#include <iomanip>  // setprecision
using namespace std;
typedef long long ll;

int main(void)
{
#ifdef FILE_DEBUG
    ifstream inputFile("data/input.txt");
    cin.rdbuf(inputFile.rdbuf());
#endif
    // これより下にコードを書く

    int N, i;
    cin >> N >> i;

    cout << (N-i+1) << endl;

    return 0;
}


Measured memory_bytes: 256
import sys
input = sys.stdin.readline

def main():
    N, M, K = map(int, input().split())
    A = list(map(int, input().split()))
    B = list(map(int, input().split()))

    import itertools
    ac = [0] + list(itertools.accumulate(A))
    bc = [0] + list(itertools.accumulate(B))
    ans, j = 0, M
    for i, a in enumerate(ac):
        if a > K:
            break
        while a + bc[j] > K:
            j -= 1
        ans = max(ans, i+j)
    print(ans)

if __name__ == '__main__':
    main()


Measured memory_bytes: 49248
#include <bits/stdc++.h>
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for(ll i = (a); i > (b); --i)
#define REP(i, n) for(ll i = 0; i < (n); ++i)
#define REPR(i, n) for(ll i = n; i >= 0; i--)
#define FOREACH(x, a) for(auto &(x) : (a))
#define dump(x) cout << #x << " = " << (x) << endl;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
using P = pair<ll, ll>;

#define int long long

signed main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int n;
  cin >> n;
  vector<int> p(n);
  REP(i, n) cin >> p[i];
  int ans = 0;
  REP(i, n - 2) {
    vector<int> z;
    z.push_back(p[i]);
    z.push_back(p[i + 1]);
    z.push_back(p[i + 2]);
    sort(all(z));
    if(p[i + 1] == z[1]) ans++;
  }
  cout << ans << endl;
  return 0;
}

Measured memory_bytes: 256
#include <bits/stdc++.h>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n - 1; 0 <= i; i--)
#define FOR(i, start, end) for (int i = start; i < end; i++)
#define RFOR(i, start, end) for (int i = start - 1; 0 <= i; i--)
#define ALL(a) a.begin(), a.end()
using ll = long long;
using namespace std;
constexpr int INF32       = 1'050'000'000;
constexpr long long INF64 = 4'000'000'000'000'000'000;
constexpr int MOD7        = 1'000'000'007;
constexpr int MOD9        = 1'000'000'009;
template <class T> inline bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T> inline bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
void print() { std::cout << '\n'; }
template <class H, class... T> void print(H &&head, T &&... args) {
    std::cout << head;
    sizeof...(args) == 0 ? std::cout << "" : std::cout << ' ';
    print(std::forward<T>(args)...);
}
template <class T> void print(std::vector<T> &v) {
    for (int i = 0; i < v.size(); i++) {
        std::cout << v[i];
        i == v.size() - 1 ? std::cout << '\n' : std::cout << ' ';
    }
}
template <class T> void print(std::vector<std::vector<T>> &v) {
    for (int i = 0; i < v.size(); i++) {
        for (int j = 0; j < v[i].size(); j++) {
            std::cout << v[i][j];
            j == v[i].size() - 1 ? std::cout << '\n' : std::cout << ' ';
        }
    }
}

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

    int N;
    cin >> N;
    vector<ll> q(N), x(N);
    REP(i, N) cin >> q[i] >> x[i];

    ll start = 100;
    ll A = 0, B = 1;
    REP(i, N) {
        if (q[i] == 1) {
            B *= x[i];
            start *= x[i];
            A *= x[i];
        }
        if (q[i] == 2) {
            A -= x[i];
            start += x[i];
        }
        if (q[i] == 3) {
            A += x[i];
            start -= x[i];
        }
    }
    start = (double)(start + A) / B;
    // print(start);
    print(A, B);

    return 0;
}


Measured memory_bytes: 3216
#include <bits/stdc++.h>
using namespace std;

using ll = long long;

ll N;
string S;

void solve(){
    for(ll i = 0; i < S.size(); ++i){
        S[i] = (char)(((ll)(S[i] - 'A') + N) % 26) + 'A';
    }
    cout << S;
}
int main(){
    cin >> N >> S;
    solve();
    return 0;
}

Measured memory_bytes: 256
/*
    @uthor: Varun Mishra
    "varun21999" ->  Codechef, Codeforce, Hackerrank, Hackerearth;
*/
//#include<boost/multiprecision/cpp_int.hpp>
//using boost::multiprecision::cpp_int;
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 
using namespace __gnu_pbds;
using namespace std;
//#define int     long long int
#define ull     unsigned int
#define ld      long double
#define pb      push_back
#define pa      pair<int,int>
#define ppa     pair<pair<int,int>,int>
#define pap     pair<int,pair<int,int>>
#define v1d     vector<int>
#define v2d     vector<vector<int> >
#define vpa     vector<pair<int,int>>
#define M       1000000007
#define MN      LLONG_MIN
#define MX      LLONG_MAX
#define ff      first
#define ss      second
#define endl    "\n"
#define v1s     vector<string>
#define all(v)  v.begin(),v.end()
#define S(v)    sort(v.begin(),v.end())
#define RS(v)          sort(v.rbegin(),v.rend())
#define R(v)           reverse(v.begin(),v.end())
#define mxpq(T)        priority_queue <T>
#define mnpq(T)        priority_queue<T,vector<T>,greater<T>>
#define T              int tc;cin>>tc;while(tc--)
#define p2d(v)         for(auto a:v){for(auto b:a)cout<<b<<" ";cout<<endl;}
#define p1d(v)         for(auto a:v)cout<<a<<" ";cout<<endl;
#define ppd(v)         for(auto a:v)cout<<a.ff<<" "<<a.ss<<endl;
#define forIloop(i,n)  for(auto i=0;i<n;i++);
#define forDloop(i,n)  for(auto i=n-1;i>=0;i--);
#define qqq 400005
#define isEven(n)  (!n & 1);
const int MOD = 1e9 + 7;
// bool isEven(int n){
//     return (!(n & 1));
// }
// int popcount(int num){
//     num = num - ((num >> 1) & 0x55555555);
//     num = (num & 0x33333333) + ((num >> 2) & 0x33333333);
//     return ((num + (num >> 4) & 0xF0F0F0F) * 0x1010101) >> 24;
// }
// int powerOfTwo(int n){
//     return 1 << n;
// }

// int arr[1000001];
// bool temet = false;


void codeforce2(){
    char c; cin>>c;
    if(isupper(c)) cout << 'A' << endl;
    else cout << 'a' << endl;
}




int32_t main(){

    cout<<fixed<<setprecision(16);
    cin.sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    
    /*#ifndef _DEBUG
     freopen("input.txt",  "r",  stdin);
     freopen("output.txt", "w", stdout);
    #endif*/
    //auto start = high_resolution_clock::now();

    // Lucario();
    //codeforceContest();
    //hackerEarth();
    //codeChef();
    codeforce2();

   /* auto stop = high_resolution_clock::now();
    auto duration = duration_cast<seconds>(stop - start);
    cout << "Time: "<<duration.count()<<endl;*/
    return 0;
}

Measured memory_bytes: 3572
import java.util.*
import java.math.*
import java.lang.Math.*

val readString: ()->String = {readLine()!!}
val readInt: ()->Int = {readLine()!!.toInt()}
val readLong: ()->Long = {readLine()!!.toLong()}
val readIntArray: ()->IntArray = {readLine()!!.split(' ').map{it.toInt()}.toIntArray()}
val readLongArray: ()->LongArray = {readLine()!!.split(' ').map{it.toLong()}.toLongArray()}
val errPrintln: (String)->Unit = {msg -> System.err.println(msg)}
val MOD = 1e9.toLong()+7
val INF = Int.MAX_VALUE/2
val LINF = Long.MAX_VALUE/2

fun gcd(a: Long, b: Long): Long {
    if (b == 0L) return a
    return gcd(b, a%b)
}
fun lcm(a: Long, b: Long): Long {
    return a / gcd(a, b) * b
}

fun solve(T: LongArray): Long {
    val N = T.size
    var res = T[0]
    for (i in 1 until N) {
        res = lcm(res, T[i])
    }

    return res
}


fun main(args: Array<String>) {
    val N = readInt()
    val T = LongArray(N){0}
    for (i in 0 until N) {
        T[i] = readLong()
    }

    val ans = solve(T)

    println(ans)
}


Measured memory_bytes: 33560
#include <bits/stdc++.h>
#define LL long long
#define PII pair<int,int>
#define PIL pair<int,LL>
#define PLI pair<LL,int>
#define PIII pair<int,PII>
#define PLL pair<LL,LL>
#define PLII pair<LL,PII>
#define VI vector<int>
#define VVI vector<VI>
#define VL vector<LL>
#define VVL vector<VL>
#define VPII vector<PII>
#define FF first
#define SS second
#define MP make_pair
#define PB push_back
#define all(x) x.begin(),x.end()
#define watch(x) cout<<(#x)<<" = "<<(x)<<'\n'
#define mset(a,v) memset(a,v,sizeof(a))
#define setp(x) cout<<fixed<<setprecision(x)
#define EPS 0.00000000001
#define PI acos(-1)
#define loop(i,b,n) for(int i=b;i<n;++i)
#define rev_loop(i,b,n) for(int i=b;i>=n;--i)
using namespace std;

const int MOD = 1e9 + 7;
const LL MX = 1e9;
const LL INF = 1e9;

void print_a(VI v)
{
    if(v.size()) cout<<v[0];
    loop(i,1,v.size()) cout<<' '<<v[i];
    cout<<'\n';
}

VVI init_vvi(int n, int m, int val)
{
    return VVI(n,VI(m,val));
}

VVL init_vvl(int n, int m, LL val)
{
    return VVL(n,VL(m,val));
}

int main()
{
    //ofstream out("output.txt");
    //ifstream in("input.txt");
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);

    int n;
    cin>>n;
    int f = 0;

    loop(i,1,10)
    {
        loop(j,1,10) if(i * j == n) {f = 1; break;}
    }

    if(f) cout<<"Yes\n";
    else cout<<"No\n";

    /*
    int t,n;
    cin>>t;
    while(t--)
    {
        cin>>n;
        int a[n];
        loop(i,0,n)
        {
            cin>>a[i];
        }
    }
    */

    /*
    int n;
    cin>>n;
    int a[n];
    loop(i,0,n)
    {
        cin>>a[i];
    }
    */

    /*
    cout<<ans<<'\n';

    if(f) cout<<"YES\n";
    else cout<<"NO\n";

    if(f) cout<<"Yes\n";
    else cout<<"No\n";
    */

    return 0;
}


Measured memory_bytes: 3572
#include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
#define pi pair<int,int>
#define pl pair<long long,long long>
#define lg length()
#define pb push_back
#define MAXN 100005
#define INF 1000000005
#define LINF 1000000000000000005

double t[105],v[105],st,ans,fkt[105];

int n;

int32_t main(){
    ios_base :: sync_with_stdio(0); cin.tie(); cout.tie();
    cin >> n;
    for(int i=1;i<=n;i++){
        cin >> t[i];
        st+=t[i];
        fkt[i]=fkt[i-1]+t[i-1];
    }
    for(int i=1;i<=n;i++){
        cin >> v[i];
    }
    fkt[n+1]=st;
    double vt=0,tc=0;
    int id=1;
    for(int i=1;i<=2*st;i++){
        int st=3; if(vt==v[id]) st=2;
        for(int j=id+1;j<=n+1;j++){
            if(fkt[j]-tc==vt-v[j]) st=1;
        }
        tc+=(double)1/2;
        if(st==3){
            ans+=vt/2+(double)1/8;
            vt+=(double)1/2;
        }
        else if(st==2){
            ans+=vt/2;
        }
        else{
            ans+=vt/2-(double)1/8;
            vt-=(double)1/2;
        }
        if(tc==fkt[id+1]){
            id++;
        }
    }
    cout << fixed << setprecision(5) << ans;
}


Measured memory_bytes: 256
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <set>
#include <map>
#include <string>
#include <queue>
#include <ctime>

#define ll long long
#define ld long double
#define mod 1000000007
#define inf 1e6
using namespace std;
//ifstream cin("input.txt"); ofstream cout("output.txt");
//ifstream cin("pageant.in"); ofstream cout("pageant.out");

int main() {
	cin.tie(0); ios_base::sync_with_stdio(false);
	ll a, b, c;
	cin >> a >> b >> c;
	ll x, y;
	cin >> x >> y;
	ll mn = min(x, y);
	ll mx = max(x, y);
	ll ans = 0;
	if (a + b > 2*c) {
		ans += c * 2 * mn;
	}
	else {
		ans += a*x + b*y;
		cout << ans;
		return 0;
	}
	x -= mn;
	y -= mn;
	if (x > 0) {
		if (a < 2 * c) {
			ans += a*x;
		}
		else {
			ans += x * 2 * c;
		}
	}
	else if (y > 0){
		if (b < 2 * c) {
			ans += b*y;
		}
		else {
			ans += y * 2 * c;
		}
	}
	cout << ans;
	return 0;
}

Measured memory_bytes: 256
#include<bits/stdc++.h>
using namespace std;
int main(){
	string a,b,c;
  cin>>a>>b>>c;
	if(a[a.size()-1]==b[0] and b[b.size()-1]==c[0]) cout<<"YES"<<endl;
  else cout<<"NO"<<endl;
  return 0;
}


Measured memory_bytes: 256
function Main(input){
  //パラメータ受取り
  input = input.split("\n");
  inputStr = input[0].split(" ");
  var H = Number.parseInt(inputStr[0]);
  var cnt = 0;
  var ans = 1;
  while ( H > 1 ){
    //割り算処理
    H = Math.floor(H/2);
    cnt++;
    ans += Math.pow(2,cnt);
  }
  //回答出力
  console.log(ans);
}
Main(require("fs").readFileSync("/dev/stdin", "utf8"));


Measured memory_bytes: 7372
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int maxn = 5e4 + 10;

bitset<maxn> bs[maxn];
int x[2*maxn], y[2*maxn];
int par[maxn];
bool dir[2*maxn];
int b[maxn], cnt[maxn];

int get_par(int v){ return par[v] < 0 ? v : par[v] = get_par(par[v]); }

void merge(int v, int u){
	if ((v = get_par(v)) == (u = get_par(u)))
		return;
	par[v] = u;
}

int main(){
	ios_base::sync_with_stdio(false);
	mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
	int n, m, T;
	cin >> n >> m >> T;
	for (int i = 1; i <= m; i++)
		cin >> x[i] >> y[i];
	if (T == 1){
		for (int i = 1; i <= n; i++)
			bs[i][i] = 1;
		for (int i = 1; i <= m; i++){
			bs[x[i]] |= bs[y[i]];
			bs[y[i]] |= bs[x[i]];
		}
		int root = -1;
		for (int i = 1; i <= n; i++)
			if (bs[i].count() == n)
				root = i;
		if (root == -1)
			return cout << -1 << endl, 0;
		memset(par, -1, sizeof par);
		string s;
		for (int i = m; i >= 1; i--){
			if (get_par(x[i]) == get_par(root)){
				s += '^';
				merge(x[i], y[i]);
			}
			else if (get_par(y[i]) == get_par(root)){
				s += 'v';
				merge(x[i], y[i]);
			}
			else
				s += 'v';
		}
		reverse(s.begin(), s.end());
		cout << s << endl;
	}
	else{
		if (n == 2)
			return cout << -1 << endl, 0;
		for (int i = 1; i <= n; i++)
			b[i] = i, cnt[i] ++;
		string s;
		for (int i = m; i >= 1; i--){
			if (cnt[b[x[i]]] >= 2){
				s += 'v';
				cnt[b[x[i]]] --, cnt[b[y[i]]] ++;
				b[x[i]] = b[y[i]];
			}
			else if (cnt[b[y[i]]] >= 2){
				s += '^';
				cnt[b[x[i]]] ++, cnt[b[y[i]]] --;
				b[y[i]] = b[x[i]];
			}
			else{
				s += '^';
				cnt[b[x[i]]] ++, cnt[b[y[i]]] --;
				b[y[i]] = b[x[i]];
			}
		}
		reverse(s.begin(), s.end());
		cout << s << endl;
	}
}


Measured memory_bytes: 311696
#include "bits/stdc++.h"
#define rep(i,a,n) for(int i = (a);i < (n);i++)
typedef unsigned long long ull;
typedef long long ll;
using namespace std;

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

ull lcm(ull a,ull b){
	return a*b / gcd(a,b);
}

int main(){
	ull n,memo,m;
	cin >> n;
	
	rep(i,0,n){
		cin >> m;
		if(!i){
			memo = m;
		}
		else{
			memo = memo / gcd(memo,m) * m;
		}
	}
	cout << memo << endl;
	return 0;
}

Measured memory_bytes: 256