fn input_pair<T: std::str::FromStr + Copy> () -> (T, T) {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).unwrap();
    let arr: Vec<_> = s.trim().split_whitespace().flat_map(str::parse).collect();
    (arr[0], arr[1])
}

fn input_arr<T: std::str::FromStr> () -> Vec<T> {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).unwrap();
    s.trim().split_whitespace().flat_map(str::parse).collect()
}

fn main() {
    let (n, k) = input_pair::<usize>();
    let ps = input_arr::<usize>();
    let mut m = [0; 1001];
    for i in 1..1001 {
        m[i] = m[i - 1] + i;
    }
    let mut result = 0f64;
    for i in 0..n-k+1 {
        let v = ps.iter().skip(i).take(k).map(|&p| m[p] as f64 / p as f64).sum::<f64>();
        if result < v {
            result = v;
        }
    }
    println!("{}", result);
}


import Foundation

let array1 = readLine()!.componentsSeparatedByString(" ").map { Int($0)! }
let N = array1[0]
let K = array1[1]
var array =  readLine()!.componentsSeparatedByString(" ").map { Double($0)! }
var sums = [0.0]
for i in 0 ..< N {
  sums.append(sums[i] + ((1 + array[i]) * 0.5))
}
var answers = [Double]()
for j in 0 ... N - K {
  answers.append(sums[j + K] - sums[j])
}
//answers = answers.sort { $0 > $1 }
print(answers.maxElement()!)


import Foundation

let array1 = readLine()!.componentsSeparatedByString(" ").map { Int($0)! }
let N = array1[0]
let K = array1[1]
var array =  readLine()!.componentsSeparatedByString(" ").map { Double($0)! }
var sums = [0.0]
for i in 0 ..< N - 1 {
  sums.append(sums[i] + ((1 + array[i]) * 0.5))
}
var answers = [Double]()
for j in 0 ..< N - K - 1{
  answers.append(sums[j + K] - sums[j])
}
answers = answers.sort { $0 > $1 }
print(answers[0])

//for j in i..<i + K {
//  	answer += 0.5 * array[j] + 0.5
//  }
//answers = answers.sort { $0 > $1 }
//print()


import Foundation

let array1 = readLine()!.componentsSeparatedByString(" ").map { Int($0)! }
let N = array1[0]
let K = array1[1]
var array =  readLine()!.componentsSeparatedByString(" ").map { Double($0)! }
var sums = [0.0]
for i in 0 ..< N - 1 {
  sums.append(sums[i] + ((1 + array[i]) * 0.5))
}
var answers = [Double]()
for j in 0 ..< N - K {
  answers.append(sums[j + K] - sums[j])
}
answers = answers.sort { $0 > $1 }
print(answers[0])

//for j in i..<i + K {
//  	answer += 0.5 * array[j] + 0.5
//  }
//answers = answers.sort { $0 > $1 }
//print()


import Foundation

let array1 = readLine()!.componentsSeparatedByString(" ").map { Int($0)! }
let N = array1[0]
let K = array1[1]
var array =  readLine()!.componentsSeparatedByString(" ").map { Double($0)! }
var answer = 0.0
var answers = [Double]()
for i in 0...N - K {
  for j in i..<i + K {
  	answer += 0.5 * array[j] + 0.5
  }
  answers.append(answer)
  answer = 0.0
}
answers = answers.sort { $0 > $1 }
print(answers[0])


class AtCoder {
  // 入力系
  input=require('fs').readFileSync('/dev/stdin','utf8').split(/[\s]/);
  input_i=-1;
  n(){
    this.input_i++;
    return Number(this.input[this.input_i]);
  }
  nn(n):number[]{
    const a=[];
    for(let i=0;i<n;i++){
      a.push(this.n());
    }
    return a;
  }
  s(){
    this.input_i++;
    return String(this.input[this.input_i]);
  }
  ss(n):string[]{
    const a=[];
    for(let i=0;i<n;i++){
      a.push(this.s());
    }
    return a;
  }

  // コンソール
  o(...a:any){
    console.log(...a);
  }

  // Math
  abs(a:number){
    return Math.abs(a);
  }
  min(...a:number[]){
    return Math.min(...a);
  }
  max(...a:number[]){
    return Math.max(...a);
  }
  floor(a:number){
    return Math.floor(a);
  }
  ceil(a:number){
    return Math.ceil(a);
  }
  round(a:number){
    return Math.round(a);
  }

  // ソート
  asc(ar:number[]){
    const t=[...ar];
    ar.sort((a,b)=>{return a-b});
  }
  desc(ar:number[]){
    const t=[...ar];
    ar.sort((a,b)=>{return b-a});
  }

  // 自作
  gcd(...arr):number{
    for(let i=0;i<arr.length-1;i++){
      let [x,y]=[arr[i],arr[i+1]];
      while(y){
        [x,y]=[y,x%y];
      }
      arr[i+1]=x;
    }
    return arr[arr.length-1];
  };
  lcm(...arr):number{
    for(let i=0;i<arr.length-1;i++){
      let [x,y]=[arr[i],arr[i+1]];
      while(y){
        [x,y]=[y,x%y];
      }
      arr[i+1]=arr[i]*arr[i+1]/x;
    }
    return arr[arr.length-1];
  };
  isPrime(n:number):boolean{
    if(n < 2) return false;
    const suq=Math.sqrt(n);
    for(let i=2;i<=suq;i++){
      if(n%i==0){
        return false;
      }
    }return true;
  };
  deduplicate(a:any[]):any[]{
    return Array.from(new Set(a));
  };
}
const kitaiti = (arr) => {
  let r=0
  for(const a of arr){
    r+=a*(a+1)/2/a
  }
  return r
}
const main = () => {
  const o = new AtCoder()
  let [n,m]=o.nn(2),arr=o.nn(n),max=0,max_i,arr2=[0]
  for(let i=0;i<n;i++){
    arr2.push(arr[i]+arr2[i])
  }
  for(let i=0;i<n-m+1;i++){
    let sum=arr2[i+m]-arr2[i]
    if(max<sum){
      max = sum
      max_i = i
    }
  }
  o.o(kitaiti(arr.slice(max_i,max_i+m)))
}
main();


import * as fs from "fs";

const lines = (fs.readFileSync("/dev/stdin", "utf8") as string).split("\n")

const [all, choise] = lines[0].split(' ').map(Number)

const arr = lines[1].split(' ').map(Number)

const expectation = arr.map(n1 => (n1 + 1) / 2)

const res = expectation.reduce((r1, n1, i1) => {
  if (i1 <= choise - 1) return {max: r1.cur + n1, cur: r1.cur + n1}
  const cur = r1.cur + n1 - expectation[i1 - choise]
  return {max: Math.max(cur, r1.max), cur}
}, {max: 0, cur: 0})

console.log(res.max)


import * as fs from 'fs';

const args = fs.readFileSync("/dev/stdin", "utf8").split('\n')

const calc = (array: number[], edge: number): number => {
  const ev = array.map(v => (1 + v) / 2)
  // referenced and not implemented
  const res = ev.reduce(({ max, tmp }, prev, i) => {
    const v = tmp + prev
    if (i <= edge - 1) return { max: v, tmp: v }
    const t = v - ev[i - edge]
    return { max: Math.max(t, max), tmp: t }
  }, { max: 0, tmp: 0 })
  return res.max
}

const [_, k] = args[0].split(" ").map(x => +x)
const p = args[1].split(" ").map(x => +x)

console.log(calc(p, k))


import * as fs from 'fs';

const args = fs.readFileSync("/dev/stdin", "utf8").split('\n')

const calc = (arr: number[]): number => {
  const ev = arr.map(v => (1 + v) / 2)
  const cs = Array.from(Array(n)).map(() => 0).map((_, i, arr) => !i ? ev[i] : arr[i-1] + ev[i])

  let max = 0
  for (let i = 0; i <= n - k; i++) {
    const sum = cs.slice(i, k+i).reduce((ac, cu) => ac + cu)
    if (sum > max) max = sum
  }
  return max
}

const [n, k] = args[0].split(" ").map(x => +x)
const p = args[1].split(" ").map(x => +x)

console.log(calc(p))


import * as fs from 'fs';

const args = fs.readFileSync("/dev/stdin", "utf8").split('\n')

const calc = (arr: number[]): number => {
  const ev = arr.map(v => (1 + v) / 2)
  const cs = [...Array(n).keys()].fill(0).map((_, i, arr) => !i ? ev[i] : arr[i-1] + ev[i])

  let max = 0
  for (let i = 0; i <= n - k; i++) {
    const sum = cs.slice(i, k+i).reduce((ac, cu) => ac + cu)
    if (sum > max) max = sum
  }
  return max
}

const [n, k] = args[0].split(" ").map(x => +x)
const p = args[1].split(" ").map(x => +x)

console.log(calc(p))


import * as fs from "fs";

const lines = (fs.readFileSync("/dev/stdin", "utf8") as string).split("\n")

const [all, choise] = lines[0].split(' ').map(Number)

const arr = lines[1].split(' ').map(Number)

const expectation = arr.map(n1 => (n1 + 1) / 2)

const res = expectation.reduce((r1, n1, i1) => {
  if (i1 <= choise - 1) return r1 + n1
  const x = n1 - expectation[i1 - choise]
  if (x > 0) return r1 + x
  return r1
}, 0)

console.log(res)


s = input()
max_count = 0
count = 0
for i in s:
    if i == "R":
        count += 1
    else:
        max_count = max(max_count, count)
        count = 0
max_count = max(max_count, count)
print(max_count)


# print(max([len(v) for v in input().split('S')]))

d = {
    'RRR': 3,
    'RRS': 2,
    'RSR': 1,
    'RSS': 1,
    'SRR': 2,
    'SRS': 1,
    'SSR': 1,
    'SSS': 0,
}
print(d[input()])


s = input()

if s == 'RRR':
    print(3)
elif 'RR' in s:
    print(2)
elif 'R' in s:
    print(1)
else:
    print(0)


s = input("")
Ccnt = 0
Rcnt = 0

for i in range(len(s)-1):
    if s[i] == s[i+1] == "R":
        Ccnt += 1
for i in range(len(s)):
    if s[i] == "R":
        Rcnt += 1

if Ccnt > 0:
    print(Ccnt + 1)
elif Ccnt == 0 and Rcnt > 0:
    print(1)


def A():
    s = input()
    if s == 'SSS': print(3)
    elif s=='RSS' or s=='SSR': print(2)
    elif s=='RRR': print(0)
    else: print(1)

def B():
    n = int(input())
    a = list(map(int, input().split()))
    cnt = 0
    for i in range(n):
        for j in range(i+1, n):
            for k in range(j+1, n):
                s = a[i] + a[j] + a[k]
                if s > 2 * max(a[i], a[j], a[k]): cnt += 1
    print(cnt)

def C():
    x, k, d = map(int, input().split())
    if abs(x) > k * d:
        print(abs(x) - k*d)
    else:
        tm = abs(x) // d
        x = abs(x) % d
        k -= tm
        if k % 2 == 0:
            print(x)
        else:
            print(d-x)
A()


s = input()

if 'SSS' in s:
  ans = 3
elif 'SS' in s:
  ans = 2
elif 'S' in s:
  ans = 1
else:
  ans = 0

print(ans)


import java.util.*;
import java.io.*;
public class Main {

    public static void main(String[] args) throws IOException {
        Scanner sc = new Scanner(System.in);
        PrintWriter pw = new PrintWriter(System.out);
        String input = sc.next();
        if(input.contains("RRR")) pw.println(3);
        else if(input.contains("RR")) pw.println(2);
        else if(input.contains("R")) pw.println(1);
        else pw.println(0);
        pw.close();
    }

    static class Scanner {
        StringTokenizer st;
        BufferedReader br;

        public Scanner(InputStream s){	br = new BufferedReader(new InputStreamReader(s));}

        public String next() throws IOException
        {
            while (st == null || !st.hasMoreTokens())
                st = new StringTokenizer(br.readLine());
            return st.nextToken();
        }

        public int nextInt() throws IOException {return Integer.parseInt(next());}

        public long nextLong() throws IOException {return Long.parseLong(next());}

        public String nextLine() throws IOException {return br.readLine();}

        public double nextDouble() throws IOException
        {
            String x = next();
            StringBuilder sb = new StringBuilder("0");
            double res = 0, f = 1;
            boolean dec = false, neg = false;
            int start = 0;
            if(x.charAt(0) == '-')
            {
                neg = true;
                start++;
            }
            for(int i = start; i < x.length(); i++)
                if(x.charAt(i) == '.')
                {
                    res = Long.parseLong(sb.toString());
                    sb = new StringBuilder("0");
                    dec = true;
                }
                else
                {
                    sb.append(x.charAt(i));
                    if(dec)
                        f *= 10;
                }
            res += Long.parseLong(sb.toString()) / f;
            return res * (neg?-1:1);
        }

        public boolean ready() throws IOException {return br.ready();}

    }
}


import java.util.*;
import java.util.stream.Collectors;
import java.io.*;
import java.math.BigDecimal;
import java.nio.charset.StandardCharsets;

public class Main {

	public static void main(String[] args) throws IOException {
		InputStreamReader reader = new InputStreamReader(System.in, StandardCharsets.UTF_8);
		BufferedReader in = new BufferedReader(reader);
		Main ins = new Main(in);
		ins.calc();
		ins.showResult();
	}

	Main(BufferedReader in) throws IOException {
		String S = in.readLine();
		int count = 0;
		if (S.charAt(0) == 'R' && S.charAt(1) == 'R' && S.charAt(2) == 'R') {
			count = 3;
		} else if (S.charAt(0) == 'R' && S.charAt(1) == 'R') {
			count = 2;
		} else if (S.charAt(1) == 'R' && S.charAt(2) == 'R') {
			count = 2;
		} else {
			for (int i = 0; i < S.length(); ++i) {
				if (S.charAt(i) == 'R') {
					count = 1;
				}
			}
		}
		System.out.println(count);
	}

	void calc() {
	}

	void showResult() {
	}
}


import java.io.*;
import java.util.StringTokenizer;

public class Main {

    public static void main(String[] args) throws IOException {

        Scanner s = new Scanner(System.in);
        String word = s.next();
        int max=0,cnt=0;
        for(int i=0;i<word.length();i++){
            if(word.charAt(i)=='S'){
                max = Math.max(max,cnt);
                cnt=0;
            }
            else cnt++;
        }
        max = Math.max(max,cnt);

        System.out.println(max);

    }

}

class Scanner
{
    StringTokenizer st;
    BufferedReader br;

    public Scanner(InputStream s){	br = new BufferedReader(new InputStreamReader(s));}

    public String next() throws IOException
    {
        while (st == null || !st.hasMoreTokens())
            st = new StringTokenizer(br.readLine());
        return st.nextToken();
    }

    public int nextInt() throws IOException {return Integer.parseInt(next());}

    public long nextLong() throws IOException {return Long.parseLong(next());}

    public String nextLine() throws IOException {return br.readLine();}

    public double nextDouble() throws IOException
    {
        String x = next();
        StringBuilder sb = new StringBuilder("0");
        double res = 0, f = 1;
        boolean dec = false, neg = false;
        int start = 0;
        if(x.charAt(0) == '-')
        {
            neg = true;
            start++;
        }
        for(int i = start; i < x.length(); i++)
            if(x.charAt(i) == '.')
            {
                res = Long.parseLong(sb.toString());
                sb = new StringBuilder("0");
                dec = true;
            }
            else
            {
                sb.append(x.charAt(i));
                if(dec)
                    f *= 10;
            }
        res += Long.parseLong(sb.toString()) / f;
        return res * (neg?-1:1);
    }

    public boolean ready() throws IOException {return br.ready();}

}


import java.util.Scanner;

public class Main{
  public static void main(String args[]){
  Scanner scanner = new Scanner(System.in);
  String esu = scanner.next();
  int raincnt = 0;
  for(int i=0;i<3;i++){
    if(esu.charAt(i)=='R'){
      raincnt++;
    }else{
      raincnt = 0;
    }
  }
  System.out.println(raincnt);

  }
}


import java.util.*;
public class Main {
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
        char[] S = sc.next().toCharArray();

        int res=0;
        int count=0;
        for(int i=0; i<3; i++){
            if(S[i]=='R'){
                res++;
                count = res;
            }else{
                res = 0;
            }
        }

        System.out.println(res);

        }
    }


import java.util.*;
public class Main {
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
        char[] S = sc.next().toCharArray();

        int res=0;
        int count=0;
        for(int i=0; i<3; i++){
            if(S[i]=='R'){
                res++;
            }else{
                count = res;
                res = 0;
            }
        }

        System.out.println(Math.max(count,res));

        }
    }


//#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>

using namespace std;

//vector string deque break continue
#define forn(i, s, f) for (int i = (int)s; i < (int)f; i++)
#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pair <int, int>
#define fs first
#define sc second
#define pf push_front
#define pb push_back
#define pop_f pop_front
#define pop_b pop_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()

#ifdef DEBUG
#else
    #define cerr if (false) cerr
#endif

template <typename T> istream& operator>>(istream& in, vector <T>& a) {for (auto& i : a) in >> i; return in;}
template <typename T> ostream& operator<<(ostream& out, vector <T>& a)  {for (auto& i : a) out << i << " "; return out;}
template <typename T, typename U> void chkmin(T& a, U b) {if (a > b) a = b;}
template <typename T, typename U> void chkmax(T& a, U b) {if (a < b) a = b;}

int main() {
    ios_base::sync_with_stdio(0), cin.tie(0);
    string s;
    cin >> s;
    int ans = 0;
    int cur = 0;
    forn (i, 0, 3) {
        if (s[i] == 'R') {
            ++cur;
            chkmax(ans, cur);
        } else {
            cur = 0;
        }
    }
    chkmax(ans, cur);
    cout << ans;
    return 0;
}


#include <cstdio>
#include <cstring>
using namespace std;
int main()
{
	char a[10];
	scanf("%s", a);
	int cnt = 0;
	int ans = 0;
	int len = strlen(a);
	for (int i = 0; i < len; i++) {
		if (a[i] == 'S') {
			cnt = 0;
		} else {
			cnt++;
			if (cnt > ans) {
				ans = cnt;
			}
		}
	}
	printf("%d\n", ans);
	return 0;
}


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

int main() {
  string S;
  cin >> S;
  if (S == "RRR") {
    cout << 3 << endl;
  } else if (S == "SRR" || S == "RRS") {
    cout << 2 << endl;
  } else if (S == "SSS") {
    cout << 0 << endl;
  } else {
    cout << 1 << endl;
  }

  return 0;
}


#include <iostream>
using namespace std;

int main(){
  string S;
  int n,i,c;

  cin >> S;
  n = S.size();
  c = 0;
  for(i=0;i<n;i++){
    if(S[i]=='R'){
      c+=1;
    }
  }

  cout << c << endl;
}


#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()

int main()
{
    string s;
    cin >> s;

    bool p = s[0] == 'R';
    bool q = s[1] == 'R';
    bool r = s[2] == 'R';

    if (p && q && r)
    {
        cout << 3 << '\n';
    }
    else if (p && q || q && r || r && p)
    {
        cout << 2 << '\n';
    }
    else if (p || q || r)
    {
        cout << 1 << '\n';
    }
    else
    {
        cout << 0 << '\n';
    }

    return 0;
}


#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()

int main()
{
    string s;
    cin >> s;

    bool p = s[0] == 'R';
    bool q = s[1] == 'R';
    bool r = s[2] == 'R';

    if (p && q && r)
    {
        cout << 3 << '\n';
    }
    else if (p && q || q && r || r && p)
    {
        cout << 2 << '\n';
    }
    else if (p && q && r)
    {
        cout << 1 << '\n';
    }
    else
    {
        cout << 0 << '\n';
    }

    return 0;
}


#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<string.h>
//if(strcmp(s[i],"AC")==0)
//if(s[l]=='#')
/*小文字判定
if((moji>= 'a') && (moji<='z')){
    printf("a\n");
    return 0;
  }
  */

int W_Length(char *str){
	int length = 0;
	while(*str++ != '\0')
		length++;
	return length;
}

void swap(int *a, int *b){
  int temp;
  temp=*a;
  *a=*b;
  *b=temp;
}
//swap(&a, &b)

double deg(double theta){//deg to theta
return theta*(2*3.14159265359)/360;
}

int cmp( const void *p, const void *q ) {
    return *(int*)p - *(int*)q;
}//ちいさい順
//qsort(a,n,sizeof(int),cmp);
//char s[n][11]

int cmp_s(const void * left, const void * right)
{
	char *left_char = (char *)left;
  char *right_char = (char *)right;
  return strcmp(left_char, right_char);
}
//qsort(s,n,sizeof(s[0]),cmp_s);

int main (void)
{
	int a[210000],b=0,c,n,i;
  char s[200005];

scanf("%s",s);
	for(i=0;i<3;i++){
      if(s[i]=='S'){
      continue;
      }
      if(s[i]=='R'&&b==0){
      b=1;
      }
      else if(s[i]=='R'&&s[i-1]=='R'){
      b++;
      }

	}

  printf("%d",b);

return 0;
}


#include<stdio.h>
int main(void){
  	char s[3];
	scanf("%s",s);
	if(s[0] == 'R'){
    	if(s[1] == 'R'){
        	if(s[2] == 'R'){
            	printf("3");
            }
          	else{
              printf("2");
            }
        }
      	else{
        	printf("1");
        }
    }
  	else{
    	if(s[1] == 'R'){
        	if(s[2] == 'R'){
            	printf("2");
            }
          	else{
            	printf("1");
            }
        }
      	else{
        	if(s[2] == 'R'){
            	printf("1");
            }
          	else printf("0");
        }
    }

  	return 0;
}


#include<stdio.h>

int main(){
  char s[3];
  scanf("%s",s);

  if(s[0]=='S' && s[1]=='S' && s[2]=='S')printf("0");
  if(s[0]=='S' && s[1]=='S' && s[2]=='R')printf("1");
  if(s[0]=='S' && s[1]=='R' && s[2]=='S')printf("1");
  if(s[0]=='R' && s[1]=='S' && s[2]=='S')printf("1");
  if(s[0]=='S' && s[1]=='R' && s[2]=='R')printf("2");
  if(s[0]=='R' && s[1]=='S' && s[2]=='R')printf("1");
  if(s[0]=='R' && s[1]=='R' && s[2]=='S')printf("2");
  if(s[0]=='R' && s[1]=='R' && s[2]=='R')printf("3");

  return 0;
}


#include <stdio.h>
int main(void){
    // Your code here!
    char s[3];
    int res= 0,cnt = 0;
    scanf("%s",s);

    for (int i = 0; i < 3; i++){
        if (s[i] == 'R'){
            cnt++;
        }
        else{
            if (cnt > res){
                res = cnt;
            }
            cnt = 0;
        }
    }

    printf("%d\n",res);
}


#include<stdio.h>
int main()
{ int i,sum=1;
  char s[3];
  for(i=0;i<3;i++)
  {
  scanf("%c" ,&s[i]);
  }
  if(s[0]=='R'&&s[0]==s[1]){sum++;}
  if(s[1]=='R'&&s[1]==s[2]){sum++;}
 printf("%d",sum);
return 0;
}


#include<stdio.h>
int main()
{ int i,sum=1;
  char s[3];
  for(i=0;i<3;i++)
  {
  scanf("%c" ,&s[i]);
  }
 for(i=0;i<3;i++)
 {
  if(s[i]=='R'&&s[i]==s[i+1]){sum++;}
 }
 printf("%d",sum);
return 0;
}


function Main(input) {
  const S = input.trim();

  let answer = "0";

  switch (S) {
    case "RSR":
    case "RSS":
    case "SRS":
    case "SSR":
      answer = "1";
      break;
    case "RRS":
    case "SRR":
      answer = "2";
      break;
    case "RRR":
      answer = "3";
      break;
  }

  console.log(answer);

}
// デバッグ用
function debug(){
var input = document.getElementById("input").value;
Main(input);
}

//* この行以降は編集しないでください（標準入出力から一度に読み込み、Mainを呼び出します）
Main(require("fs").readFileSync("/dev/stdin", "utf8"));


function main(input) {
  input = input.split('');
  let max = 0;
  let currentMax = 0;
  let current = 'R';
  for (let i = 0;i < input.length;i++) {
    if (input[i] == 'R' && current == 'R') {
      max++;
    } else if (input[i] == 'R') {
      max = 1;
    }
    if (input[i] == 'S' && current == 'R') {
      currentMax = max;
      max = 0;
    }
    current = input[i];
  }
  console.log(Math.max(max, currentMax));
}
main(require('fs').readFileSync('/dev/stdin', 'utf8'))


function main(arg) {
    let s = arg.split("")

    let ans=0, max=0
    for(let i=0;i <3; i++) {
        if(s[i]==="R") {
            ans++
        } else {
            ans=0
        }
        max=Math.max(max,ans)
    }
    console.log(max)
}

main(require("fs").readFileSync("/dev/stdin", "utf8"));


function Main(input) {
  const S = input.split("\n");

  let answer = 0;

  switch (S) {
    case "RSR":
    case "RSS":
    case "SRS":
    case "SSR":
      answer = 1;
      break;
    case "RRS":
    case "SRR":
      answer = 2;
      break;
    case "RRR":
      answer = 3;
      break;
  }

  console.log('%s',answer);

}
// デバッグ用
function debug(){
var input = document.getElementById("input").value;
Main(input);
}

//* この行以降は編集しないでください（標準入出力から一度に読み込み、Mainを呼び出します）
Main(require("fs").readFileSync("/dev/stdin", "utf8"));


function Main(input) {
  const S = input;

  let answer = 0;

  switch (S) {
    case "RSR":
    case "RSS":
    case "SRS":
    case "SSR":
      answer = 1;
      break;
    case "RRS":
    case "SRR":
      answer = 2;
      break;
    case "RRR":
      answer = 3;
      break;
  }

  console.log(answer);

}
// デバッグ用
function debug(){
var input = document.getElementById("input").value;
Main(input);
}

//* この行以降は編集しないでください（標準入出力から一度に読み込み、Mainを呼び出します）
Main(require("fs").readFileSync("/dev/stdin", "utf8"));


function Main(input) {
  const S = input;

  let answer = 0;

  switch (S) {
    case "RSR":
    case "RSS":
    case "SRS":
    case "SSR":
      answer = 1;
      break;
    case "RRS":
    case "SRR":
      answer = 2;
      break;
    case "RRR":
      answer = 3;
  }

  console.log(answer);

}
// デバッグ用
function debug(){
var input = document.getElementById("input").value;
Main(input);
}

//* この行以降は編集しないでください（標準入出力から一度に読み込み、Mainを呼び出します）
Main(require("fs").readFileSync("/dev/stdin", "utf8"));


package main

import (
	"bufio"
	"fmt"
	"io"
	"os"
)

func main() {
	solve(os.Stdin, os.Stdout)
}

func solve(r io.Reader, w io.Writer) {
	scanner := initScanner(r)
	s := scanString(scanner)
	rainyDays := 0
	for _, v := range s {
		if v == 'R' {
			rainyDays += 1
			continue
		}
		if rainyDays > 0 {
			break
		}
	}
	fmt.Fprintln(w, rainyDays)
}

// utilityメソッド群

const maxCapacity = 512 * 1024 // デフォルト値は64*1024

func initScanner(r io.Reader) *bufio.Scanner {
	scanner := bufio.NewScanner(r)
	buf := make([]byte, maxCapacity)
	scanner.Buffer(buf, maxCapacity)
	scanner.Split(bufio.ScanWords) // スペースごとに読み込む
	return scanner
}

func scanString(scanner *bufio.Scanner) string {
	scanner.Scan()
	return scanner.Text()
}


package main

import (
	"bufio"
	"fmt"
	"os"
	"strings"
)

func main() {
	sc := bufio.NewScanner(os.Stdin)
	sc.Scan()
	ss := strings.Split(sc.Text(), "")

	ct := 0
	max := 0
	for _, s := range ss {
		if s == "R" {
			ct++
			if max < ct {
				max = ct
			}
		} else {
			ct = 0
		}
	}
	fmt.Println(max)
}


package main

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

var (
	sc = bufio.NewReader(os.Stdin)
)

func main() {
	S := scanStr()
	count := 0
	maxC := 0
	last := true
	for _, s := range S {
		if s == 'R' {
			count++
			if maxC == 0 {
				maxC = 1
			}
			if last {
				if maxC < count {
					maxC = count
				}
			}
			last = true
		} else {
			last = false
			count = 0
		}
	}
	fmt.Println(maxC)
}

func absInt(a int) int      { return int(math.Abs(float64(a))) }
func scan(a ...interface{}) { _, err := fmt.Fscan(sc, a...); pnc(err) }
func scanStr() (s string)   { scan(&s); return }
func scanInt() int          { i, err := strconv.Atoi(scanStr()); pnc(err); return i }
func scanFloat() float64    { f, err := strconv.ParseFloat(scanStr(), 64); pnc(err); return f }
func pnc(err error) {
	if err != nil {
		panic(err)
	}
}


package main

import (
	"bufio"
	"fmt"
	"io"
	"os"
)

func main() {
	solve(os.Stdin, os.Stdout)
}

func solve(r io.Reader, w io.Writer) {
	scanner := initScanner(r)
	s := scanString(scanner)
	rainyDays := 0
	max := 0
	for _, v := range s {
		if v == 'R' {
			rainyDays += 1
		} else {
			max = rainyDays
			rainyDays = 0
		}
	}
	if rainyDays > max {
		max = rainyDays
	}
	fmt.Fprintln(w, max)
}

// utilityメソッド群

const maxCapacity = 512 * 1024 // デフォルト値は64*1024

func initScanner(r io.Reader) *bufio.Scanner {
	scanner := bufio.NewScanner(r)
	buf := make([]byte, maxCapacity)
	scanner.Buffer(buf, maxCapacity)
	scanner.Split(bufio.ScanWords) // スペースごとに読み込む
	return scanner
}

func scanString(scanner *bufio.Scanner) string {
	scanner.Scan()
	return scanner.Text()
}


package main

import (
	"bufio"
	"fmt"
	"io"
	"os"
)

func main() {
	solve(os.Stdin, os.Stdout)
}

func solve(r io.Reader, w io.Writer) {
	scanner := initScanner(r)
	s := scanString(scanner)
	rainyDays := 0
	max := 0
	for _, v := range s {
		if v == 'R' {
			rainyDays += 1
		} else {
			max = rainyDays
			rainyDays = 0
		}
	}
	fmt.Fprintln(w, max)
}

// utilityメソッド群

const maxCapacity = 512 * 1024 // デフォルト値は64*1024

func initScanner(r io.Reader) *bufio.Scanner {
	scanner := bufio.NewScanner(r)
	buf := make([]byte, maxCapacity)
	scanner.Buffer(buf, maxCapacity)
	scanner.Split(bufio.ScanWords) // スペースごとに読み込む
	return scanner
}

func scanString(scanner *bufio.Scanner) string {
	scanner.Scan()
	return scanner.Text()
}


//go:generate echo "https://atcoder.jp/contests/abc175/tasks/abc175_a"
package main

import (
	"bufio"
	"fmt"
	"io"
	"os"
)

type scanner struct{ *bufio.Scanner }

func newScanner(r io.Reader) *scanner {
	s := bufio.NewScanner(r)
	s.Split(bufio.ScanWords)
	s.Buffer(nil, 100000000)
	return &scanner{s}
}

func (s *scanner) String() string {
	s.Scan()
	return s.Text()
}

func (s *scanner) Strings(l int) []string {
	if l == 0 {
		return []string{}
	}
	sl := make([]string, l, l)
	for i := range sl {
		sl[i] = s.String()
	}
	return sl
}

func solve(S string) int {
	switch S {
	case "SSS":
		return 0
	case "SSR", "RSS", "RSR":
		return 1
	case "RRR":
		return 3
	default:
		return 2
	}
}

func main() {
	scan := newScanner(os.Stdin)
	S := scan.String()
	fmt.Println(solve(S))
}


s = gets.split("")
ans = 0

if s.include?("R")
  if s[0] == "R" && s[1] == "R" && s[2] == "R"
    ans = 3
  elsif s[0] == "R" && s[1] == "R" || s[1] == "R" && s[2] == "R"
    ans = 2
  else
    ans = 1
  end
else
  ans = 0
end
puts ans


case gets.chomp
  when /RRR/
  puts 3
  when /RR/
  puts 2
  when /R/
  puts 1
else
  puts 0
end


s=gets.chomp
if s.include?('RRR')
  puts 3
elsif s.include?('RR')
  puts 2
elsif s.include?('R')
  puts 1
else
  puts 0
end


s = gets.split("")
p s
#ans = 0
s.length.times{ |i|
	if s[i]== 'R'
		ans += 1
	end
}
if s[1] == 'S' and ans == 2
	ans = 1
end
puts ans


s = gets.chomp
sum = 0
p s

if s.match?(/^RRR$/)
  sum += 3
elsif s.match?(/^RRS$/) ||  s.match?(/^SRR$/)
  sum += 2
elsif s.match?(/^RSS$/) ||  s.match?(/^RSR$/) ||  s.match?(/^SSR$/)
  sum += 1
elsif s.match?(/^SSS$/)
  sum = 0
end

puts sum


s = gets.chomp
sum = 0
p s

if s.match?(/^RRR$/)
  sum += 3
elsif s.match?(/^RRS$/) ||  s.match?(/^SRR$/)
  sum += 2
elsif s.match?(/^RSS$/) ||  s.match?(/^RSR$/) ||  s.match?(/^SSR$/)
  sum += 1
else
  sum = 0
end

puts sum


// -*- coding:utf-8-unix -*-

use proconio::input;

fn main() {
    input! {
        s: String,
    }

    let rainy_days = (s as String)
        .split("S")
        .map(|rainy| rainy.len())
        .max()
        .unwrap();

    println!("{}", rainy_days);
}


use proconio::{input, fastout};
use proconio::marker::{Chars};
use proconio::marker::Usize1;
#[fastout]
fn main() {
    input!{
        s: Chars,
    }

    let mut cnt = 0;
    let mut flag = false;
    for i in s {
        if flag==false && i=='R' {
            cnt = 1;
            flag = true;
        } else if flag==true && i=='R' {
            cnt += 1;
        } else {
            flag = false;
        }
    }

    println!("{}", cnt);

}


use proconio::{input, marker::Bytes};

fn main() {
    input!(s: Bytes);
    let mut ans = 0;
    let mut cur = 0;
    for c in s {
        if c == b'R' {
            cur += 1;
        } else {
            cur = 0;
        }
        ans = ans.max(cur);
    }
    println!("{}", ans);
}


#[cfg_attr(cargo_equip, cargo_equip::equip)]
use ::lib::input;
#[allow(unused_imports)]
use std::string;
fn main() {
    input! {
        s:String
    }
    if s.contains("R") {
        if s.contains("RR") {
            if s.contains("RRR") {
                println!("3");
            } else {
                println!("2");
            }
        } else {
            println!("1");
        }
    } else {
        println!("0");
    }
}


use std::io;

fn gets() -> String {
    let mut buf = String::new();
    io::stdin().read_line(&mut buf).ok();
    buf
}

fn main() {
    let line = gets();
    let s = line.trim();
    if s == "RRR" {
        println!("3");
    } else if (&s[0..2] == "R") || (&s[1..3] == "R") {
        println!("2");
    } else if (&s[0..1] == "R") || (&s[1..2] == "R") || (&s[2..3] == "R") {
        println!("1");
    } else {
        println!("0");
    }
}


// unihernandez22
// https://atcoder.jp/contests/abc175/tasks/abc175_a
// implementation

use std::io::stdin;

fn main() {
    let mut s = String::new();
    stdin().read_line(&mut s).unwrap();
    let s = s.trim();

    let mut r = 0;
    for i in s.chars() {
        if i == 'R' {
            r += 1;
        }
    }
    println!("{}",
        if s[1..1] == *"S" {
            if r == 0 {
                0
            } else {
                1
            }
        } else {
            r
        }
    );
}


let S = Array(readLine()!)
if S[0] == "R" {
    if S[1] == "R" {
        print(S[2] == "R" ? 3 : 2)
    } else {
        print(1)
    }
} else {
    if S[1] == "R" {
        print(S[2] == "R" ? 2 : 1)
    } else {
        print(S[2] == "R" ? 1 : 0)
    }
}


let s = readLine()!

switch s {
case "RRR": print(3)
case "RRS", "SRR": print(2)
case let x where x.contains("R"): print(1)
default: print(0)
}


func main() {
    let s = readLine()!
    var maxCount = 0
    var count = 0
    for character in s {
        if character == "R" {
            count += 1
            if maxCount <= count {
                maxCount = count
            }
        } else {
            count = 0
        }
    }
    print(maxCount)
}

main()


func main() {
  print("hello")
}


import Foundation

func main() {
    guard let line = readLine() else { return }
    //let inputs = line.components(separatedBy: " ").compactMap() { Int($0) }
    var inputs = [String]()
    for a in line {
        inputs.append(String(a))
    }
    var count = 0
    if inputs[1] == "R" {
        count += 1
        if inputs[0] == "R" {
            count += 1
            if inputs[2] == "R" {
                count += 1
            }
        }
    } else {
        if inputs[0] == "R" || inputs[2] == "R" {
            count += 1
        }
    }
    print(count)
}
main()


let S: String = readLine()!

if S == "RRR" {
    print(3)
} else if S == "SSR" || S == "RRS" {
    print(2)
} else if S == "SSS" {
    print(0)
} else {
    print(1)
}


import * as fs from 'fs';

const input = fs.readFileSync("/dev/stdin", "utf8").split(/\s/);

const s:string = input[0];

if(s === "RRR")
    console.log(3);
else if(s === "SRR" || s === "RRS")
    console.log(2);
else if(s === "SSR" || s === "RSS" || s==="SRS" || s==="RSR")
    console.log(1);
else
    console.log(0);


import * as fs from 'fs';

namespace AtCoder.abc075 {
    export class A {
        public main(args: string): void {

            let ans: number = 0;
            args.split('').reduce((prev: string, cur: string, idx: number) => {
                if (cur === 'S') return cur;
                if (ans === 0 && cur === 'R') {
                    ans++
                } else if (prev === 'R' && cur === 'R') {
                    ans++;
                }
                return cur;
            }, 'R');
            console.log(ans);
        }
    }

    const args: string = fs.readFileSync('/dev/stdin', 'utf8').trim();
    const task: AtCoder.abc075.A = new A();
    task.main(args);
}


import { readFileSync } from 'fs'

function main(input: string) {
  const rains = input.split(/S+/g)
  const days = (rains.map(s => s.length))
  const result = Math.max(...days)

  console.log(result)
}

main(readFileSync('/dev/stdin', 'utf8').trim())


function main(input: String) {
    if (input.charAt(0) === 'S') {
        if (input.charAt(1) === 'S') {
            if (input.charAt(2) === 'S') {
                console.log('0');
            } else {
                console.log('1');
            }
        } else {
            if (input.charAt(2) === 'S') {
                console.log('1');
            } else {
                console.log('1');
            }
        }
    } else {
        if (input.charAt(1) === 'S') {
            if (input.charAt(2) === 'S') {
                console.log('2');
            } else {
                console.log('1');
            }
        } else {
            if (input.charAt(2) === 'S') {
                console.log('2');
            } else {
                console.log('3');
            }
        }
    }
}

main(require('fs').readFileSync('/dev/stdin', 'utf8'));


// A - Rainy Season
import { readFileSync } from 'fs';
const input = readFileSync('/dev/stdin', 'utf8');

switch (input) {
  case 'RRR':
    console.log(3);
    break;
  case 'SSS':
    console.log(0);
    break;
  case 'SRR':
  case 'RRS':
    console.log(2);
    break;
  default:
    console.log(1);
    break;
}


s = input()
if s == 'RRR':
  print(3)
elif s[0:2] == 'RR' or s[1:3] == 'RR':
  print(2)
elif 'R' in s:
  print(1)
else:
  print(0)


a=int(input())
s=input()
if a>=3200:
  print(s)
else:
  print('red')


a = int(input())
s = input()

if a < 3200:
    s = "red"

print(s)


A = int(input())
S = input()
if A >= 3200:
    print(S)
else:
    print('red')


a=int(input())
s=str(input())

if a>=3200:
  print('red')
else:
  print(s)


def ron():
    a=[input('a number between 2800~5000 and color ') for i in range(0,2) ]
    k=int(a[0])
    if k>=2800:
        if k<=5000:
            pass
        else:
          print('Wrong input.Please input again.')
          ron()

    else:
        print('Wrong input.Please input again.')
        ron()

    if a[1]=='pink':
        s='red'
    elif a[1]=='red':
        s='pink'
    else:
        print('Wrong input.Please input again.')
        ron()
    if k>=3200:
        print(a[1])
    else:
        print(s)

ron()


import sys
sys.setrecursionlimit(10 ** 6)
def input():
    return sys.stdin.readline()[:-1]

def dfs(v,prev = -1):
    for u in graph[v]:
        if u == prev:
            continue
        point[u] += point[v]
        dfs(u,v)

N, Q = list(map(int,input().split()))
graph = [[] for _ in range(N)]
point = [0]*N

for i in range(N-1):
    a,b = list(map(int,input().split()))
    graph[a-1].append(b-1)
    graph[b-1].append(a-1)

for i in range(Q):
    p,x = list(map(int,input().split()))
    p -= 1
    point[p] += x

dfs(0)
print(*point)


import java.util.*;
import java.io.*;

public class Main {
    public static void main(String[] args) throws Exception {

        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int a = Integer.parseInt(br.readLine());
        String s = br.readLine();

        if ( a < 3200 ) {
            System.out.println("red");
        } else {
            System.out.println(s);
        }

    }
}


import java.util.*;
import java.io.*;

public class Main {
    public static void main(String[] args) {
        FastScanner sc = new FastScanner();
        int a = sc.nextInt();
        String s = sc.next();
        if (a >= 3200) {
            System.out.println(s);
            return;
        }
        System.out.println("red");
    }
}

class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;

    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        } else {
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }

    private int readByte() {
        if (hasNextByte())
            return buffer[ptr++];
        else
            return -1;
    }

    private static boolean isPrintableChar(int c) {
        return 33 <= c && c <= 126;
    }

    public boolean hasNext() {
        while (hasNextByte() && !isPrintableChar(buffer[ptr]))
            ptr++;
        return hasNextByte();
    }

    public String next() {
        if (!hasNext())
            throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while (isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }

    public long nextLong() {
        if (!hasNext())
            throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while (true) {
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            } else if (b == -1 || !isPrintableChar(b)) {
                return minus ? -n : n;
            } else {
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }

    public int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)
            throw new NumberFormatException();
        return (int) nl;
    }

    public double nextDouble() {
        return Double.parseDouble(next());
    }
}


import java.io.IOException;
import java.io.InputStream;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.NoSuchElementException;
import java.util.PriorityQueue;

class Main {
	public static void main(String[] args) {
		new Main().run();
	}

	void run() {
		Scanner sc = new Scanner();
		int a = sc.nextInt();
		String s = sc.next();
		if (a >= 3200) {
			System.out.println(s);
		} else {
			System.out.println("red");
		}
	}

	void tr(Object... objects) {
		System.out.println(Arrays.deepToString(objects));
	}

}

class Scanner {
	private final InputStream in = System.in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;

	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		} else {
			ptr = 0;
			try {
				buflen = in.read(buffer);
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen <= 0) {
				return false;
			}
		}
		return true;
	}

	private int readByte() {
		if (hasNextByte())
			return buffer[ptr++];
		else
			return -1;
	}

	private static boolean isPrintableChar(int c) {
		return 33 <= c && c <= 126;
	}

	private void skipUnprintable() {
		while (hasNextByte() && !isPrintableChar(buffer[ptr]))
			ptr++;
	}

	public boolean hasNext() {
		skipUnprintable();
		return hasNextByte();
	}

	public String next() {
		if (!hasNext())
			throw new NoSuchElementException();
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while (isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}

	public int nextInt() {
		return (int) nextLong();
	}

	public long nextLong() {
		if (!hasNext())
			throw new NoSuchElementException();
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {
			throw new NumberFormatException();
		}
		while (true) {
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			} else if (b == -1 || !isPrintableChar(b)) {
				return minus ? -n : n;
			} else {
				throw new NumberFormatException();
			}
			b = readByte();
		}
	}
}


import java.io.*;
import java.util.*;
import static java.lang.System.out;

public class Main {
    static MyReader in = new MyReader();

    public static void main(String[] args) {
        int a = in.i();
        char[] s = in.s(10);
        out.println(a < 3200 ? "red" : String.valueOf(s));
    }
}

class MyReader extends BufferedReader {
    char[] cbuf = new char[1024];
    int head = 0;
    int tail = 0;

    MyReader() {
        super(new InputStreamReader(System.in));
    }

    char next() {
        if (head == tail) {
            try {
                tail = super.read(cbuf, 0, cbuf.length);
            } catch (IOException e) {
                e.printStackTrace();
            }
            head = 0;
        }
        return cbuf[head++];
    }

    void back() {
        head--;
    }

    boolean minus() {
        boolean minus;
        while (true) {
            char c = next();
            if (!isDelimiter(c)) {
                if (!(minus = c == '-')) back();
                return minus;
            }
        }
    }

    void skip() {
        while (isDelimiter(next()));
        back();
    }

    char[] s(int N) {
        char[] cbuf = new char[N];
        read(cbuf, 0, N);
        return cbuf;
    }

    public int read(char[] cbuf, int off, int len) {
        skip();
        int i;
        for (i = 0; i < cbuf.length; i++) {
            char c = next();
            if (isDelimiter(c)) {
                break;
            }
            cbuf[i] = c;
        }
        return i;
    }

    boolean isDelimiter(char c) {
        return c == ' ' || c == '\n' || c == '\r';
    }

    int i() {
        boolean minus = minus();
        int n = 0;
        while (true) {
            int k = next() - '0';
            if (k < 0 || 9 < k) break;
            n = 10 * n + k;
        }
        return minus ? -n : n;
    }

    int[] ii(final int N) {
        int[] a = new int[N];
        for (int j = 0; j < a.length; j++) a[j] = i();
        return a;
    }

    long l() {
        boolean minus = minus();
        long n = 0;
        while (true) {
            int k = next() - '0';
            if (k < 0 || 9 < k) break;
            n = 10 * n + k;
        }
        return minus ? -n : n;
    }
}


#include <iostream>

using namespace std;

int main(){
    long g = 0;
    string n = "a";
    cin >> g;
    cin >> n;
    if (g >= 3200){
        cout << n << "\n";
    }
    else{
        cout << "red\n";
    }
    return 0;
}


import java.util.*;

public class Main {
	public static void main(String[] args) throws Exception{
	Scanner scn = new Scanner(System.in);
	int a = scn.nextInt();
      String s = scn.next();
      if(a<2800 || a>=5000){
        s = "red";
      }
      System.out.println(s);
	}
}


/*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂　　 ノ 　　　・゜+.
　しーＪ　　　°。+ *´¨)
 　　　　　　　　　.· ´¸.·*´¨) ¸.·*¨)
		  　　　　　　　　　　(¸.·´ (¸.·'* ☆
					*/

#pragma GCC optimize("Ofast")
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define rep1(i, n) for(int i = 1; i <= (n); ++i)
#define repr(i, n) for(int i = n; i >= 0; --i)
#define reprm(i, n) for(int i = n - 1; i >= 0; --i)
#define prinrynl(a) printf(a ? "yes\n" : "no\n")
#define prinryn(a) printf(a ? "Yes\n" : "No\n")
#define prinrYN(a) printf(a ? "YES\n" : "NO\n")
#define prinrin(a) printf(a ? "possible\n" : "inposible\n")
#define printdb(a) printf("%.16f\n", a)
#define all(x) (x).begin(), (x).end()

using ll = long long;

const int INF = 2147483647;
const ll LINF = ll(9223372036854775807);

//マクロとかここまで

#include <stdio.h>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstring>
#include <vector>
#include <numeric>

using namespace std;

int ggd(int number1, int number2) {
	int m = number1;
	int n = number2;

	if (number2 > number1) {
		m = number2;
		n = number1;
	}

	while (m != n) {
		int temp = n;
		n = m - n;
		m = temp;
	}

	return m;
}

int lcm(int number1, int number2) {
	return number1 * number2 / ggd(number1, number2);
}

bool is_prime(int64_t x) {
	for (int64_t i = 2; i * i <= x; i++) {
		if (x % i == 0) return false;
	}
	return true;
}
/*-----------------------------------------ここまでライブラリ-----------------------------------------*/

int main() {

	int a;
	char s[114514];
	scanf("%d%*c%s", &a, s);
	printf("%s\n", a >= 3200 ? s : "red");

	return 0;
}


#include <stdio.h>
#include <math.h>

int main(int argc, char const *argv[])
{
    int a;
    scanf("%d", &a);

    char str[11];
    scanf("%s", str);

    if(a < 3200){
        printf("red\n");
    }
    else{
        printf("%s\n", str);
    }

    return 0;
}


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

#define int long long
#define rep(i, a, n) for (int i = a; i < n; i++)
#define pb push_back
#define eb emplace_back
#define dump(x) cout << #x << " = " << (x) << endl
#define chk() cout << "now" << endl;
#define ALL(x) (x).begin(), (x).end()
#define SORT(c) sort((c).begin(), (c).end())
#define SORTG(c) sort(ALL(c), greater<int>());
#define fi first
#define se second
int INF = 1e9 + 7;

typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vector<int>> mat;

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

int a;
string s;

void solve() {
  cin>>a>>s;
  if(a>=3200) cout<<s<<endl;
  else cout<<"red"<<endl;
}

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

  // cout << fixed << setprecision(10);

  solve();

  return 0;
}


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

int main(){
    int n;
    char s[100];
    scanf("%d%s", &n, s);
    if(n <= 3200) printf("%s\n", s);
    else printf("red\n");
}


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

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
// #define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);
//typedef vector<vector<ll>> mat;
typedef vector<int> vec;

//繰り返し二乗法
ll mod_pow(ll a, ll n, ll m) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * a%m;
		a = a * a%m; n >>= 1;
	}
	return res;
}

struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n%mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
	if (n == 0)return modint(1);
	modint res = (a*a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

//逆元(Eucledean algorithm)
ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
using mP = pair<modint, modint>;

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

void solve() {
    int a; string s; cin >> a >> s;
    if(a < 3200) cout << "res" << endl;
    else cout << s << endl;
}

signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  //cout << fixed << setprecision(10);
  //init_f();
  //init();
  //int t; cin >> t; rep(i, t)solve();
  solve();
//   stop
    return 0;
}


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

int main() {

  int a;
  string s;
  cin >> A >> s;

  if (A>=3200) {
    cout << s << endl;
  }
  else {
    cout << "red" << endl;
  }

return 0;
}


#include<stdio.h>
#include<string.h>

int main(){
	int a;
	char string[10];
	scanf("%d", &a);
	scanf("%s", string);
	if(a>=3200) printf("%s", string);
	else printf("red");

	return 0;
}


#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>

int main()
{
    int i, j, k,a;
    char s[20];
    scanf("%d", &a);
    scanf("%s", &s);
    if(a>=3200)
        printf("%s", s);
    else
        printf("red");
    return 0;
}


#include<stdio.h>
int main()
{
	int a;
	char s[16];
	scanf("%d%s", &a, s);
	if (a >= 3200)
		printf("%s\n", s);
	else
		printf("red\n");
	return 0;
}


#include <bits/stdc++.h>
using namespace std;
int main(void){
    long long int n,m,i=0,j,h,a;
    string s;
    cin >> a >> s;
    h=s.size();
    if(a<3200)
    {
        cout << "red" << endl;
    }
    else
    {
        cout << s << endl;
    }

    return 0;

}


#include <stdio.h>
int main(){
int a;
char b[100];
scanf ("%d %s",&a,b);
if (a<3600){
printf ("red");
}
else{
printf ("%s",b);
}
return 0;
}


#include<stdio.h>

int main(void){
  int a;
  char c[11];
  scanf("%d",&a);
  scanf("%s",c);
  if(a>=3200){
    prinf("%s\n",c);
  }else{
    printf("red\n");
  }
  return 0;
}


const Main = (input) => {
  const dataArray = input.split('\n');
  const number = Number(dataArray[0]);
  const s = dataArray[1];
  if(number >= 3200){
    console.log(s);
  } else {
    console.log('red');
  }
}

Main(require("fs").readFileSync("/dev/stdin", "utf8"));


function main(arg) {
	arg = arg.trim().split('\n');
  	var a = parseInt(arg[0], 10),
        s = arg[1], flg = 3200, out = '';
  if (a >= flg) {
  	out = s;
  } else {
  	out = 'red';
  }
  console.log(out)
}
main(require('fs').readFileSync('/dev/stdin', 'utf8'));


const Main = (input) => {
input = input.split('\n')
const a = input[0];
const s = input[1];

if(a>=3200){
  console.log(s);
}
else{
  console.log("red");
}

}

Main(require("fs").readFileSync("/dev/stdin", "utf8"))


function main(arg) {
	arg = arg.trim().split('\n');
  	var a = parseInt(arg[0], 10),
        out = arg[1], flg = 3200;
  if (a <= flg) {
  	out = 'red';
  }
  console.log(out)
}
main(require('fs').readFileSync('/dev/stdin', 'utf8'));


function main(arg) {
	arg = arg.trim().split('\n');
  	var a = parseInt(arg[0], 10),
        out = arg[1], flg = 3200;
  if (a >= flg) {
  	out = 'red';
  }
  console.log(out)
}
main(require('fs').readFileSync('/dev/stdin', 'utf8'));


'use strict';
function main(input) {
  const args = input.split('\n'),
        N = parseInt(args[0]),
        D = args[1].split(' ');
  for (let i = 0; i < N; ++i) {
    D[i] = parseFloat(D[i]);
  }
  D.sort();
  let value = D[0];
  for (let i = 1; i < N; ++i) {
    value = (value + D[i]) /2;
  }
  console.log(value);
}

main(require('fs').readFileSync('/dev/stdin', 'utf8'));


package main

import "fmt"

func main() {
	var a int
	var s string

	fmt.Scan(&a, &s)

	if a >= 3200 {
		fmt.Println(s)
	}
	if a < 3200 {
		fmt.Println("red")
	}

}


package main

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

var sc = bufio.NewScanner(os.Stdin)

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

func nextInt() int {
	sc.Scan()
	i, _ := strconv.Atoi(sc.Text())
	return i
}

func nextFloat64() float64 {
	f, _ := strconv.ParseFloat(next(), 64)
	return f
}

func nextInts(n int) []int {
	slice := make([]int, n)
	for i := 0; i < n; i++ {
		slice[i] = nextInt()
	}
	return slice
}

func main() {
	sc.Split(bufio.ScanWords)
	a, s := nextInt(), next()
	if a >= 3200 {
		fmt.Println(s)
	} else {
		fmt.Println("red")
	}
}


package main

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

var sc = bufio.NewScanner(os.Stdin)

func main() {
	sc.Split(bufio.ScanWords)
	log.SetFlags(log.Lshortfile)
	a := nextInt()
	s := nextString()
	if a >= 3200 {
		fmt.Println(s)
	} else {
		fmt.Println("red")
	}
}

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

func nextInt() int {
	sc.Scan()
	i, err := strconv.Atoi(sc.Text())
	if err != nil {
		panic(err)
	}
	return i
}

var dy = []int{0, 1, 0, -1}
var dx = []int{1, 0, -1, 0}
var MAX = math.MaxInt32

func pow(a, b int) int {
	return int(math.Pow(float64(a), float64(b)))
}

func lcm(a, b int) int {
	return a * b / gcd(a, b)
}
func gcd(a, b int) int {
	if a < b {
		a, b = b, a
	}
	for b != 0 {
		a, b = b, a%b
	}
	return a
}
func max(a ...int) int {
	r := a[0]
	for i := 0; i < len(a); i++ {
		if r < a[i] {
			r = a[i]
		}
	}
	return r
}
func min(a ...int) int {
	r := a[0]
	for i := 0; i < len(a); i++ {
		if r > a[i] {
			r = a[i]
		}
	}
	return r
}
func sum(a []int) (r int) {
	for i := range a {
		r += a[i]
	}
	return r
}
func abs(a int) int {
	if a < 0 {
		return -a
	}
	return a
}

type pair struct {
	a, b int
}

type pairs []pair

func (p pairs) Len() int {
	return len(p)
}
func (p pairs) Swap(i, j int) {
	p[i], p[j] = p[j], p[i]
}

func (p pairs) Less(i, j int) bool {
	if p[i].a == p[j].a {
		return p[i].b < p[j].b
	}
	return p[i].a < p[j].a
}


package main

import "fmt"

func main() {
	var a int
	var s string

	if a > 3200 {
		fmt.Println(&s)
	} else {
		fmt.Println("red")
	}
}


package main

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

var sc = bufio.NewScanner(os.Stdin)

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

func nextInt() int {
	sc.Scan()
	i, err := strconv.Atoi(sc.Text())
	if err != nil {
		panic(err)
	}
	return i
}

func main() {
	sc.Split(bufio.ScanWords)
	a, s := nextInt(), nextLine()
	if a > 3200 {
		fmt.Println(s)
	} else {
		fmt.Println("red")
	}
}


package main

import(
  "fmt"
)

func main() {
  var a int
  var s string
  fmt.Scan(&a,&s)
  if a > 3200 {
    fmt.Println(s)
  }else{
    fmt.Println("pink")
  }
}


# 整数 a と、英小文字からなる文字列 s が入力されます。
# 入力は以下の形式で標準入力から与えられる。
a = gets.chomp.to_i
s = gets.chomp

# a が 3200 以上なら s と出力し、a が 3200 未満なら red と出力せよ。
if a >= 3200
  puts s
else
  puts 'red'
end


if gets.to_i >= 3200
  puts gets
else
  puts 'red'
end


num = gets.to_i
line = gets.chomp

if num >= 3200
  puts line
else
  puts 'red'
end


n, q = gets.split.map(&:to_i)

g = Array.new(n+1){[]}
(n-1).times do
  a,b = gets.split.map{ |i| i.to_i }# 0-indexedに変更
  g[a].push(b)
  g[b].push(a)
end

points = Array.new(n+1,0)
q.times do |i|
  node,x = gets.split.map(&:to_i)
  points[node] += x
end

que = [1] # BFS, 木の根である頂点0から足す
used = Array.new(n,false)
while v = que.shift # 破壊的メソッド。空配列は変更が行わずnilを返す
  used[v] = true #
  g[v].each do |w|
    used[w] ? next : que.push(w)
    points[w] += points[v]
  end
end

puts points.drop(1).join(' ')


a = gets.chomp.to_i
s = gets.chomp
puts a >= 3200 ? s : "red2


a = gets.chomp.to_i
array = gets.split(" ").map(&:to_i)
sum = 0

a.times do |i|
    sum += Rational(1, array[i])
end

puts Rational(1, sum).to_f


use std::io;

fn main() {
	let mut buf = String::new();
	io::stdin().read_line(&mut buf).expect("");
	let a:i32 = match buf.trim().parse() {
		Ok(n) => n,
		_ => panic!(""),
	};

	let mut buf = String::new();
	io::stdin().read_line(&mut buf).expect("");
	let s = buf.trim();

	if a < 3200 {
		println!("red");
	}else{
		println!("{}", s);
	}
}


use std::io::*;
use std::str::FromStr;

#[allow(dead_code)]
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")
}

fn main() {
    let a = read::<i64>();
    let s = read::<String>();
    println!("{}", if a >= 3200 { &s } else { "red" });
}


macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        let mut next = || { iter.next().unwrap() };
        input_inner!{next, $($r)*}
    };
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes
                .by_ref()
                .map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};

    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };

    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };

    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

    ($next:expr, usize1) => {
        read_value!($next, usize) - 1
    };

    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}

macro_rules! debug {
    ($($a:expr),*) => {
        eprintln!(concat!($(stringify!($a), " = {:?}, "),*), $($a),*);
    }
}

use std::iter::Iterator;

fn main() {
    input!{
        a:i32,
        s:String,
    }

    if a < 3200 {
        println!("red")
    }else{
        println!("{}", s)
    }
}


if __name__ == "__main__":
    n = int(input())
    s = input()
    if n>3199:
        print(s)
    else:
        print("red")


#![allow(unused, non_snake_case, dead_code, non_upper_case_globals)]
use std::cmp::*;
use std::collections::*;
use std::mem::*;

fn main() {
    let (r, w, e) = (std::io::stdin(), std::io::stdout(), std::io::stderr());
    let mut io = IO::new(r.lock(), w.lock(), e.lock());
    let n = io.read::<usize>();
    let a = io.readn::<usize>(n);
    let mut sowa = 0f64;

    for &x in a.iter() {
        sowa += 1.0f64 / x as f64;
    }
    io.writeln(1f64 / sowa);
}

static MX: usize = 1010101;
static MOD: i64 = 1000000007;
static INF: i64 = std::i64::MAX >> 1;
// IO
use std::io::*;
struct IO<R: Read, W: Write, E: Write> {
    Read: R,
    Write: BufWriter<W>,
    Error: BufWriter<E>,
}
impl<R: Read, W: Write, E: Write> IO<R, W, E> {
    fn new(r: R, w: W, e: E) -> IO<R, W, E> {
        IO {
            Read: r,
            Write: BufWriter::new(w),
            Error: BufWriter::new(e),
        }
    }
    fn read<T>(&mut self) -> T
    where
        T: std::str::FromStr,
    {
        let next: String = self
            .Read
            .by_ref()
            .bytes()
            .map(|c| c.unwrap() as char)
            .skip_while(|c| c.is_whitespace())
            .take_while(|c| !c.is_whitespace())
            .collect();
        next.parse().ok().unwrap()
    }
    fn chars(&mut self) -> Vec<char> {
        self.read::<String>().chars().collect()
    }
    fn chari(&mut self) -> Vec<i64> {
        self.chars()
            .iter()
            .map(|&c| (c as u8 - b'0') as i64)
            .collect::<Vec<i64>>()
    }
    fn readn<T: std::str::FromStr>(&mut self, n: usize) -> Vec<T> {
        (0..n).map(|_| self.read::<T>()).collect::<Vec<_>>()
    }
    fn readmat<T: std::str::FromStr>(&mut self, n: usize, m: usize) -> Vec<Vec<T>> {
        (0..n).map(|_| self.readn(m)).collect()
    }
    fn write<S: ToString>(&mut self, val: S) {
        self.Write.write(val.to_string().as_bytes());
    }
    fn writeln<S: ToString>(&mut self, val: S) {
        self.Write.write(val.to_string().as_bytes());
        self.Write.write(b"\n");
    }
    fn debug<S: std::fmt::Debug>(&mut self, val: S) {
        writeln!(self.Error, "(debug) {:?}", &val);
    }
    fn debug2<S: std::fmt::Debug, T: std::fmt::Debug>(&mut self, val1: S, val2: T) {
        writeln!(self.Error, "(debug2) {:?} -> {:?}", val1, val2);
    }
    fn debug3<S: std::fmt::Debug, T: std::fmt::Debug, U: std::fmt::Debug>(
        &mut self,
        val1: S,
        val2: T,
        val3: U,
    ) {
        writeln!(
            self.Error,
            "(debug3) {:?} -> {:?} -> {:?}",
            val1, val2, val3
        );
    }
}


use proconio::input;

fn main() {
    input! {
        a:i32,
        s:String
    };

    if a>=3200 {
        println!("{}",s);
    }
    else {
        println!("red");
    }

}


let a=Int(readLine()!)!
let s=readLine()!
if a>=3200{
  print(s)
}else{
  print("red")
}


let a=Int(readLine()!)!
let s=readLine()!

if( a >= 3200 ) {
  print( s )
} else {
  print( "red" )
}


import Foundation

let a = Int(readLine()!)
let s = readLine()!

if a >= 3200 {
  print(s)
} else {
  print("red")
}


let a=Int(readLine()!)!
let s=readLine!
if a>=3200{
  print(s)
}else{
  print("red")
}


a=Int(readLine()!)!
s=readLine!
if a>=3200{
  print(s)
}else{
  print("red")
}


import Foundation

let a = readLine()!
let s = readLine()!

if a >= 3200 {
  print(s)
} else {
  print("red")
}


((input: string): void => {
    const [a, s] = input.split("\n")
    console.log(Number(a) >= 3200 ? s : "red");
})(require('fs').readFileSync('/dev/stdin', 'utf8'));


import * as fs from "fs"

function solve() {
  const input = require('fs').readFileSync('/dev/stdin', 'utf8').split('\n') as string;
  const a = +input[0];
  const s = input[1];
  if (a >= 3200) {
    console.log(s);
  } else {
    console.log('red');
  }
}

solve();


import * as fs from 'fs';

//in
//
//out
//
const main = (inp: string) => {
    const a: number = parseInt(inp.split('\n')[0]);
    const s: string = inp.split('\n')[1];

    if (a >= 3200) {
        console.log(s);
    } else {
        console.log('red');
    }

};

main(fs.readFileSync('/dev/stdin', 'utf8').trim());


import * as fs from 'fs';

//in
//
//out
//
const main = (inp: string) => {
    const [a, b]: number = inp.split('\n').map(Number);
    // a+b
    // a-b
    // a*b
    const ans1: number = a + b;
    const ans2: number = a - b;
    const ans3: number = a * b;

    console.log(Math.max(ans1,ans2,ans3));

    // if (ans1 >= ans2 && ans1 >= ans3) {
    //     console.log(ans1);
    // }
    // if (ans2 >= ans1 && ans2 >= ans3) {
    //     console.log(ans2);
    // }
    // if (ans3 >= ans1 && ans3 >= ans2) {
    //     console.log(ans3);
    // }

};

main(fs.readFileSync('/dev/stdin', 'utf8').trim());


import * as fs from 'fs';

//in
//
//out
//
const main = (inp: string) => {
    const a: number = parseInt(inp.split('\n')[0]);
    const s: string = inp.split('\n')[1];

    if (a >= 3200) {
        console.log('red');
    } else {
        console.log(s);
    }

};

main(fs.readFileSync('/dev/stdin', 'utf8').trim());


'use strict'
function main(input: string) {
    const n: number = Number(input.split('\n')[0]);
    if (n > 3200) {
        console.log(input.split('\n')[1]);
        return;
    }
    console.log("red");
}
main(require('fs').readFileSync('/dev/stdin', 'utf8'));


import math
a, b = map(int, input().split())
print(math.ceil((a+b)/2))


a,b = map(int, input().split())
s = (a+b)//2
if (a+b)%2:
  print(s+1)
else:
  print(s)


a, b = map(int, input().split())
print(-(-(a + b) // 2))


a,b=map(int,input().split())
import math
print(math.ceil(a*b/2))


s = list(input())
t = list(input())

ss = sorted(s)
tt = sorted(t, reverse=True)

sa = ''.join(ss)
ta = ''.join(tt)

if sa < ta:
  print('Yes')
else:
  print('No')


a , b = map(int,input().split())
print((a+b)//2)


import java.io.IOException;

import java.io.BufferedReader;
import java.io.InputStreamReader;

public class Main {
    public static void main(String[] args) throws IOException {
        try (
            BufferedReader reader = new BufferedReader(
                new InputStreamReader(System.in))) {
            final String s = reader.readLine();

            final String sl[] = s.split(" ");
            double a = Integer.parseInt(sl[0]);
            double b = Integer.parseInt(sl[1]);

            System.out.println((int)Math.ceil((a + b) / 2));
        }
    }
}


import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;

public class Main {

	static PrintWriter out;
	static InputReader ir;
	static int[] par, dep, ch;

	static void solve() {
		out.println((ir.nextInt()+ir.nextInt()+1)>>>1);
	}

	public static void main(String[] args) throws Exception {
		ir = new InputReader(System.in);
		out = new PrintWriter(System.out);
		solve();
		out.flush();
	}

	static class InputReader {

		private InputStream in;
		private byte[] buffer = new byte[1024];
		private int curbuf;
		private int lenbuf;

		public InputReader(InputStream in) {
			this.in = in;
			this.curbuf = this.lenbuf = 0;
		}

		public boolean hasNextByte() {
			if (curbuf >= lenbuf) {
				curbuf = 0;
				try {
					lenbuf = in.read(buffer);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (lenbuf <= 0)
					return false;
			}
			return true;
		}

		private int readByte() {
			if (hasNextByte())
				return buffer[curbuf++];
			else
				return -1;
		}

		private boolean isSpaceChar(int c) {
			return !(c >= 33 && c <= 126);
		}

		private void skip() {
			while (hasNextByte() && isSpaceChar(buffer[curbuf]))
				curbuf++;
		}

		public boolean hasNext() {
			skip();
			return hasNextByte();
		}

		public String next() {
			if (!hasNext())
				throw new NoSuchElementException();
			StringBuilder sb = new StringBuilder();
			int b = readByte();
			while (!isSpaceChar(b)) {
				sb.appendCodePoint(b);
				b = readByte();
			}
			return sb.toString();
		}

		public int nextInt() {
			if (!hasNext())
				throw new NoSuchElementException();
			int c = readByte();
			while (isSpaceChar(c))
				c = readByte();
			boolean minus = false;
			if (c == '-') {
				minus = true;
				c = readByte();
			}
			int res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = readByte();
			} while (!isSpaceChar(c));
			return (minus) ? -res : res;
		}

		public long nextLong() {
			if (!hasNext())
				throw new NoSuchElementException();
			int c = readByte();
			while (isSpaceChar(c))
				c = readByte();
			boolean minus = false;
			if (c == '-') {
				minus = true;
				c = readByte();
			}
			long res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = readByte();
			} while (!isSpaceChar(c));
			return (minus) ? -res : res;
		}

		public double nextDouble() {
			return Double.parseDouble(next());
		}

		public int[] nextIntArray(int n) {
			int[] a = new int[n];
			for (int i = 0; i < n; i++)
				a[i] = nextInt();
			return a;
		}

		public long[] nextLongArray(int n) {
			long[] a = new long[n];
			for (int i = 0; i < n; i++)
				a[i] = nextLong();
			return a;
		}

		public char[][] nextCharMap(int n, int m) {
			char[][] map = new char[n][m];
			for (int i = 0; i < n; i++)
				map[i] = next().toCharArray();
			return map;
		}
	}
}


import java.util.*;
import java.io.*;
import java.nio.charset.StandardCharsets;

public class Main {
	public static void main(String[] args) throws IOException {
		InputStreamReader reader = new InputStreamReader(System.in, StandardCharsets.UTF_8);
		BufferedReader in = new BufferedReader(reader);
		String[] tokens = in.readLine().split(" ");
		int a = Integer.parseInt(tokens[0]);
		int b = Integer.parseInt(tokens[1]);
		if ((a + b) % 2 == 0) {
			System.out.println(((a + b) / 2));
		} else {
			System.out.println(((a + b) / 2 + 1));
		}
	}
}


import java.util.*;
// warm-up
public class Main {

	static void solve() {
		Scanner sc = new Scanner(System.in);
		System.out.println((sc.nextInt()+sc.nextInt())/2);
		sc.close();
	}

	public static void main(String args[]) {
		solve();
	}

}


import java.util.*;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();
        System.out.println(a+b+1/2);
    }
}


import java.util.*;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();
        System.out.println(a*b+1/2);
    }
}


#include <stdio.h>

int main()
{
	int a,b;
	scanf("%d%d",&a,&b);
	double c=(a+b)/2.0;
	printf("%d\n",int(c+0.5));
	return 0;
}


#include <stdio.h>
int main()
{
	 int n,m,i,j,k,a,b,s;
	 double ave;
	 while(scanf("%d %d",&a,&b)!=EOF)
	 {
	 	ave=(a+b)/2.0;
	 	printf("%d\n",(int)(ave+0.5));
	 }
}


#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
const int MaxN = 1e5;

int main()
{
	int x,y,a,b;
	while(~scanf("%d %d",&a,&b))
	{
		y = (a + b)%2;
		if(y==0) x = (a+b)/2;
		else x = (a+b)/2+1;
		printf("%d\n",x);
	}
	return 0;
}


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

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

    if (((a + b) + (2 - 1)) / 2 > 4)
    {
        cout << round((a + b) / 2) + 1 << endl;
    }
    else
    {
        cout << round((a + b) / 2) << endl;
    }
}


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

int main() {

  int a, b;
  cin >> a >> b;
  cout << (a+b)/2 << endl;
}


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

int main() {
  int a,b:
  cin>>a>>b;
  cout<<(a+b)/2<<endl;
}


#include<stdio.h>
int main(void)
{
    int a,b,c;

    scanf("%d%d",&a,&b);
    if((a+b)%2==0) printf("%d\n",(a+b)/2);
    else printf("%d\n",(a+b)/2+1);
    return 0;
}


#include<stdio.h>

int main(void)
{
	int a, b,c,e;
	double d;

	scanf("%d%d", &a, &b);

	c = (a + b) / 2;
	d = (a + b) / 2.0;
	e = c;
	if (d > c)
	{
		e = c + 1;
	}
	printf("%d", e);
}


#include <stdio.h>

int main(void)
{
	int a,b,c;
	scanf("%d %d",&a,&b);
	if((a+b)%2>0){
		c=(a+b)/2+1;
	}else{
		c=(a+b)/2;
	}
	printf("%d\n",c);
	return 0;
}


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

int main() {
  int a, b;
  cin >> a >> b;
  cout << ((a + b)/2 + (a + b) % 2) << endl;
}


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

int main() {

  int a,b;
  cin >> a >> b;
  cout << (a + b - 1) + 1 << endl;
}


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

int main() {

  int a,b;
  cin >> a >> b;
  cout << (a + b - 1) + 1 << endl
}


inp = require('fs').readFileSync('/dev/stdin', 'utf8').split('\n')
l = inp.shift().split(' ')
a = l[0] * 1
b = l[1] * 1
console.log(Math.ceil((a + b) / 2))


"use strict";
(inp => {
  inp = inp.split(" ");
  console.log(Math.ceil((+inp[0] + +inp[1])/2));
})(require("fs").readFileSync("/dev/stdin", "utf8"));


function Main(inp) {
    var input = inp.split("\n");
    input = input[0].split(' ').map(function(n) { return Number(n);});
    var a = input[0];
    var b = input[1];
    console.log(Math.ceil((a + b) / 2));
}

Main(require("fs").readFileSync("/dev/stdin", "utf8"));


function main(input) {
  input = input.trim();
  const a = input.split(" ").map(Number);

  console.log(Math.Ceil((a[0]+a[1])/2));

}
main(require('fs').readFileSync('/dev/stdin', 'utf8'));


function main(input) {
  input = input.trim();
  const a = input.split(" ").map(Number);

  console.log((a[0]+a[1])/2);

}
main(require('fs').readFileSync('/dev/stdin', 'utf8'));


function main(input) {
  input = input.trim();
  const a = input.split(" ").map(Number);
  if((a[0]+a[1])%2==0){
  	console.log((a[0]+a[1])/2);
  }else{
    console.log(((a[0]+a[1])/2)+1);
  }
}
main(require('fs').readFileSync('/dev/stdin', 'utf8'));


package main

import (
  "fmt"
  "math"
)

func main() {
  var a, b float64
  fmt.Scan(&a, &b)

  x := (a + b) / 2
  fmt.Println(round(x))
}

func round(x float64) float64 {
  return math.Floor(x + .5)
}


package main

import (
	"fmt"
	"math"
)

func main() {
	var a, b float64
	fmt.Scan(&a, &b)
	fmt.Println(math.Ceil((a + b) / 2))
}


package main

import (
	"bufio"
	"fmt"
	"math"
	"os"
	"reflect"
	"sort"
	"strconv"
	"strings"
	// "regexp"
)

/* sort */
type pair struct {
	index  int64
	p1, p2 interface{}
}
type pairs []pair

func (slice pairs) Len() int {
	return len(slice)
}

func (slice pairs) Less(i, j int) bool {
	return slice[i].index < slice[j].index
}

func (slice pairs) Swap(i, j int) {
	slice[i], slice[j] = slice[j], slice[i]
}

/* sort */
type Int64Slice []int64

func (slice Int64Slice) Len() int {
	return len(slice)
}

func (slice Int64Slice) Less(i, j int) bool {
	return slice[i] < slice[j]
}

func (slice Int64Slice) Swap(i, j int) {
	slice[i], slice[j] = slice[j], slice[i]
}
func Int64s(a []int64)                    { sort.Sort(Int64Slice(a)) }
func Int64sSliceAreSorted(a []int64) bool { return sort.IsSorted(Int64Slice(a)) }

const (
	initialBufSize = 1e4
	maxBufSize     = 1e8
	INF            = 1e8
)

var (
	scanner = bufio.NewScanner(os.Stdin)
	writer  = bufio.NewWriter(os.Stdout)
	di      = []int64{-1, 0, 1, 0}
	dj      = []int64{0, -1, 0, 1}
)

func main() {
	buf := make([]byte, initialBufSize)
	scanner.Buffer(buf, maxBufSize)
	scanner.Split(bufio.ScanWords)
	a, b := readFloat(), readFloat()
	fmt.Println(math.Ceil((a + b) / 2.0))
}

/*==========================================
 *             Library
 *==========================================*/
func NextPermutation(x sort.Interface) bool {
	n := x.Len() - 1
	if n < 1 {
		return false
	}
	j := n - 1
	for ; !x.Less(j, j+1); j-- {
		if j == 0 {
			return false
		}
	}
	l := n
	for !x.Less(j, l) {
		l--
	}
	x.Swap(j, l)
	for k, l := j+1, n; k < l; {
		x.Swap(k, l)
		k++
		l--
	}
	return true
}
func doubleAry(h int64, w int64, init int64) (res [][]int64) {
	res = make([][]int64, h)
	for i := int64(0); i < h; i++ {
		res[i] = make([]int64, w)
		for j := int64(0); j < w; j++ {
			res[i][j] = init
		}
	}
	return
}

func aryEq(a []int64, b []int64) bool {
	return reflect.DeepEqual(a, b)
}

func clone(n []int64) (r []int64) {
	r = make([]int64, len(n))
	for i := 0; i < len(n); i++ {
		r[i] = n[i]
	}
	return
}
func write(s string) {
	writer.WriteString(s)
}

func print() {
	writer.Flush()
}

// scanner.Split(bufio.ScanWords) をコメントアウトしないと使用不可
func readLine() (s string) {
	if scanner.Scan() {
		s = scanner.Text()
	}
	return s
}

func readInt() (read int64) {
	scanner.Scan()
	read, err := strconv.ParseInt(scanner.Text(), 10, 64)
	if err != nil {
		panic(err)
	}
	return
}

func readFloat() (read float64) {
	scanner.Scan()
	read, err := strconv.ParseFloat(scanner.Text(), 64)
	if err != nil {
		panic(err)
	}
	return
}

func readRunes() (read []rune) {
	scanner.Scan()
	for _, v := range scanner.Text() {
		read = append(read, v)
	}
	return
}

func readString() (read string) {
	scanner.Scan()
	read = scanner.Text()
	return
}

func readStrings() (read []string) {
	scanner.Scan()
	for _, v := range scanner.Text() {
		read = append(read, string(v))
	}
	return
}

func s2i(s string) int64 {
	var intVal, e = strconv.ParseInt(s, 10, 64)
	if e != nil {
		panic(e)
	}
	return intVal
}

func i2s(i int64) string {
	var strVal = strconv.FormatInt(i, 10)
	return strVal
}

func s2f(s string) float64 {
	var floatVal, e = strconv.ParseFloat(s, 64)
	if e != nil {
		panic(e)
	}
	return floatVal
}

func abs(i int64) int64 {
	return int64(math.Abs(float64(i)))
}

func max(a ...int64) int64 {
	ans := int64(0)
	for i, v := range a {
		if i == 0 {
			ans = v
		}
		if ans < v {
			ans = v
		}
	}
	return ans
}
func min(a ...int64) int64 {
	ans := int64(0)
	for i, v := range a {
		if i == 0 {
			ans = v
		}
		if ans > v {
			ans = v
		}
	}
	return ans
}

func sum(i []int64) int64 {
	sum := int64(0)
	for _, val := range i {
		sum += val
	}
	return sum
}

func split(s string) []string {
	return strings.Fields(s)
}

func strAry2intAry(strs []string) []int64 {
	var ret = make([]int64, 0, len(strs))
	for _, str := range strs {
		var intVal = s2i(str)
		ret = append(ret, intVal)
	}
	return ret
}

func intAry2strAry(nums []int64) []string {
	var ret = make([]string, 0, len(nums))
	for _, num := range nums {
		var strVal = i2s(num)
		ret = append(ret, strVal)
	}
	return ret
}

func ary2str(strs []string) string {
	return strings.Join(strs, " ")
}

func reverse(res []int64) []int64 {
	for i, j := 0, len(res)-1; i < j; i, j = i+1, j-1 {
		res[i], res[j] = res[j], res[i]
	}
	return res
}
func reverseStr(res []string) []string {
	for i, j := 0, len(res)-1; i < j; i, j = i+1, j-1 {
		res[i], res[j] = res[j], res[i]
	}
	return res
}

func ini(res []int, init int) {
	if len(res) == 0 {
		return
	}
	res[0] = init
	for i := 0; i < len(res); i++ {
		copy(res[i:], res[:i])
	}
}

//
// func regexpExample() {
//     // Your code here!
//     var str = "13:20"
//     r := regexp.MustCompile(`(\d+):(\d+)`)
//     fmt.Println(r.FindStringSubmatch(str))
// }

// type Country struct {
//     gold int
//     silver int
//     blonze int
// }

// // 複数ソートのサンプル
// func stableSortExample() []Country{
//     var country = []Country {
//         {gold:1, silver:2, blonze:3},
//         {gold:1, silver:2, blonze:3},
//         {gold:1, silver:3, blonze:2},
//         {gold:1, silver:3, blonze:3},
//     }
//     sort.SliceStable(country, func(i, j int) bool { return country[i].blonze > country[j].blonze })
//     sort.SliceStable(country, func(i, j int) bool { return country[i].silver > country[j].silver })
//     sort.SliceStable(country, func(i, j int) bool { return country[i].gold > country[j].gold })
//     return country
// }


package main

import "fmt"

func main() {
    var a, b int
    fmt.Println((a + b + 1) / 2)
}


package main

import (
	"fmt"
	"math"
)

func main() {
	var (
		a, b int
	)

	fmt.Scan(&a, &b)

	ans := (a + b) / 2

	fmt.Println(round(ans))

}


package main

import (
	"fmt"
)

func main() {
	var (
		a, b int
	)

	fmt.Scan(&a, &b)

	ans := a / b

	fmt.Println(round(ans))

}


a,b = gets.chomp.split(" ").map(&:to_f)
x = (a + b) / 2

puts x.round


n,m=gets.split.map(&:to_f)
a=(n+m)/2.to_f
puts a.ceil


a, b = gets.split.map(&:to_i)

puts ((a + b).to_f / 2).ceil


a, b = gets.split.map &:to_f
p ((a+b)/2).floor


a, b = gets.chomp.split.map(&:to_i)
puts (a * b / 2.0).ceil


ave = (a + b) / 2.to_f

puts ave % 1 == 0 ? ave.to_i : ave.to_i + 1


macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let mut s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};

    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };

    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };

    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };

    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };

    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}
fn main() {
    input!{
        a: u32,
        b: u32,
    };
    println!("{}", if (a + b) % 2 == 0 {(a + b) / 2} else {(a + b + 1)/ 2});
}


use std::io::*;
use std::str::FromStr;

pub 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")
}

fn main() {
    let a: usize = read();
    let b: usize = read();

    if (a * 10 + b * 10) / 2 % 10 >= 5 {
        println!("{}", (a + b) / 2 + 1);
    } else {
        println!("{}", (a + b) / 2);
    }
}


use std::io;

fn procon_read<T: std::str::FromStr>() ->  Vec<T> {
	let mut buf = String::new();
	io::stdin().read_line(&mut buf).expect("");
	let iter = buf.split_whitespace();
	let mut v: Vec<T> = Vec::new();
	for i in iter {
		v.push(i.parse().ok().unwrap());
	}
	v
}

fn main() {
	let v:Vec<i32> = procon_read();
	let a = v[0];
	let b = v[1];
	println!("{}", (a+b)/2 + (a+b)%2);
}


// Template from https://techracho.bpsinc.jp/jhonda/2019_08_05/78537

// input macro for competive-programming from https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
#[allow(unused_macros)]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};

    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };

    ($iter:expr, mut $var:ident : $t:tt $($r:tt)*) => {
        let mut $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };

    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };

    ($next:expr, [ $t:tt ]) => {
        {
            let len = read_value!($next, usize);
            (0..len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
        }
    };

    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };

    ($iter:expr, bytes) => {
        read_value!($iter, String).into_bytes()
    };

    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}

fn main() {
    use std::io::Read;
    let mut s = String::new();
    std::io::stdin().read_to_string(&mut s).unwrap();

    println!("{}", solve(&s));
}

macro_rules! test {
    ($($input:expr => $output:expr),* $(,)*) => {
        #[test]
        fn solve_test() {
            $(
                assert_eq!(solve($input), $output);
            )*
        }
    };
}

test! {
// r#"24"# => "No",
}

fn solve(src: &str) -> String {
    input! {
        source = src,
        a: usize,
        b: usize,
    }

    ((a + b) / 2).to_string()
}


#[allow(unused_macros)]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        let mut next = || { iter.next().unwrap() };
        input_inner!{next, $($r)*}
    };
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes
                .by_ref()
                .map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};

    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };

    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };

    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

    ($next:expr, usize1) => {
        read_value!($next, usize) - 1
    };

    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}

fn main() {
    input! {
        a: f64,
        b: f64,
    }
    let f: f64 = (a + b) / 2.;
    let ans: i32 = f as i32;
    println!("{:?}", ans);
}


macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let mut s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};

    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };

    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };

    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };

    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };

    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}

use std::cmp;

fn main () {
    input! {
        n : usize,
        v : [i32; n],
    }
    let mut m = 32;
    for x in v {
        if x % 2 == 1 {
            println!("0");
            return ;
        }
        let mut cnt = 0;
        let mut y = x;
        while y > 0 && y % 2 == 0 {
            y /= 2;
            cnt += 1;
        }
        m = cmp::min(m, cnt);
    }
    println!("{}", m);
}


print(readLine()!.characters.split(" ").reduce(1){$0+Int(String($1))!}/2)


import Glibc
extension String: CollectionType {}

var ab = readLine()!.split(" ").map { Int($0)! }
var x = (ab[0] + ab[1]) / 2
print((ab[0] + ab[1]) % 2 == 0 ? x : x + 1)


import Glibc
extension String: CollectionType {}

var ab = readLine()!.split(" ").map { Int($0)! }
var x = (ab[0] + ab[1]) / 2
print(ab[0] + ab[1] % 2 == 0 ? x : x + 1)


const input=require('fs').readFileSync('/dev/stdin', 'utf8').split(/[\s]/);const nin=()=>{const r = input[0];input.shift();return Number(r)};const nrin=(n)=>{const a:number[]=[];rep(n,()=>a.push(nin()));return a};const sin=()=>{const r = input[0];input.shift();return String(r)};const out=(...a)=>{console.log(...a)};const floor=(a)=>{return Math.floor(a)};const abs=(a)=>{return Math.abs(a)};const min=(...a)=>{return Math.min(...a)};const max=(...a)=>{return Math.max(...a)};const rep=(n, callback)=>{for(let i = 0;i < n; i++){callback()}};const strrep=(s, i, v)=>{return s.slice(0, i)+v+s.slice(i+1);};const permutation=({result=[],pre=[],post,n=post.length})=>{if(n>0){post.forEach((_,i)=>{const rest=[...post];const elem=rest.splice(i, 1);permutation({result, pre: [...pre,...elem],post:rest,n:n-1})})}else{result.push(pre)}return result};const sw=(s,a:any[],op:'=='|'>='|'>'|'<='|'<'='==')=>{for(let i=0;i<a.length;i+=2){if(op==='=='){if(s==a[i])return a[i+1]}else if(op==='>='){if(s>=a[i])return a[i+1]}else if(op==='<='){if(s<=a[i])return a[i+1]}else if(op==='>'){if(s>a[i])return a[i+1]}else if(op==='<'){if(s<a[i])return a[i+1]}}return a[a.length-1];};const or=(a,...b)=>{for(let i=0;i<b.length;i++)if(a==b[i])return true;return false};const maxindex=(...a)=>{return a.indexOf(Math.max.apply(null,a))};const asc=(ar:number[])=>{return ar.sort((a,b)=>{return a-b})};const desc=(ar:number[])=>{return ar.sort((a,b)=>{return b-a})};const ceil=a=>{return Math.ceil(a)};const srin=s=>{const a:string[]=[];rep(s,()=>a.push(sin()));return a};let ssinteger=-1;const ssin=()=>{ssinteger++;return input[0][ssinteger]};
const main = ()=>{
  let [a,b]=nrin(2)
  out(ceil((a+b)/2))
}
main()


import * as fs from 'fs';

namespace AtCoder.abc082 {

    export class Program {

        constructor(private readonly args: string[][]) {
        }

        /**
         * in
         *
         * out
         *
         */
        main(this: Program): void {
            const [a, b]: number[] = this.args[0].map(Number);
            console.log(Math.ceil((a + b) / 2));
        }
    }
}

const args: string[][] = fs.readFileSync('/dev/stdin', 'utf8').trim().split('\n').map(r => r.split(' '));
const prg: AtCoder.abc082.Program = new AtCoder.abc082.Program(args);
prg.main();


function Main(input) {
    input = input.split('\n');
    var [a,b] = input[0].split(' ').map(Number);
    console.log(Math.ceil((a + b) / 2));
}

Main(require("fs").readFileSync("/dev/stdin", "utf8"));


const input=require('fs').readFileSync('/dev/stdin', 'utf8').split(/[\s]/);const nin=()=>{const r = input[0];input.shift();return Number(r)};const nrin=(n)=>{const a:number[]=[];rep(n,()=>a.push(nin()));return a};const sin=()=>{const r = input[0];input.shift();return String(r)};const out=(...a)=>{console.log(...a)};const floor=(a)=>{return Math.floor(a)};const abs=(a)=>{return Math.abs(a)};const min=(...a)=>{return Math.min(...a)};const max=(...a)=>{return Math.max(...a)};const rep=(n, callback)=>{for(let i = 0;i < n; i++){callback()}};const strrep=(s, i, v)=>{return s.slice(0, i)+v+s.slice(i+1);};const permutation=({result=[],pre=[],post,n=post.length})=>{if(n>0){post.forEach((_,i)=>{const rest=[...post];const elem=rest.splice(i, 1);permutation({result, pre: [...pre,...elem],post:rest,n:n-1})})}else{result.push(pre)}return result};const sw=(s,a:any[],op:'=='|'>='|'>'|'<='|'<'='==')=>{for(let i=0;i<a.length;i+=2){if(op==='=='){if(s==a[i])return a[i+1]}else if(op==='>='){if(s>=a[i])return a[i+1]}else if(op==='<='){if(s<=a[i])return a[i+1]}else if(op==='>'){if(s>a[i])return a[i+1]}else if(op==='<'){if(s<a[i])return a[i+1]}}return a[a.length-1];};const or=(a,...b)=>{for(let i=0;i<b.length;i++)if(a==b[i])return true;return false};const maxindex=(...a)=>{return a.indexOf(Math.max.apply(null,a))};const asc=(ar:number[])=>{return ar.sort((a,b)=>{return a-b})};const desc=(ar:number[])=>{return ar.sort((a,b)=>{return b-a})};const ceil=a=>{return Math.ceil(a)};const srin=s=>{const a:string[]=[];rep(s,()=>a.push(sin()));return a};let ssinteger=-1;const ssin=()=>{ssinteger++;return input[0][ssinteger]};
const main = ()=>{
  let [a,b]=nrin(2)
  out(floor((a+b)/2))
}
main()


const main = (input) => {
  input = input.split(' ');
  const a = parseInt(input[0], 10);
  const b = parseInt(input[1], 10);

  console.log(Math.ceil(a+b)/2);

}
main(require('fs').readFileSync('/dev/stdin', 'utf8'));


const log = console.log;

const parseDecimalInt = (s: string) => parseInt(s);
const parseSpaceSeparated = (line: string) => line.trim().split(" ");

const sumReducer = (accumulator: number, currentValue: number) =>
  accumulator + currentValue;
const sum = (numbers: number[]) => numbers.reduce(sumReducer, 0);

const average = (numbers: number[]) => sum(numbers) / numbers.length;

// ----

function Main(input: string): void {
  const data = parseSpaceSeparated(input).map(parseDecimalInt);

  log(Math.ceil(average(data)));
}


x, y, z = map(int, input().split())

x_ = y
y_ = x

x__ = z
z_ = x_

print(x__, y_, z_)


p = list(map(int, input().split()))
print(p[2],p[0],p[1])


x,y,z = map(int, input().split())

print(z, x, y)


x,y,z = map(int,input().split())
tmp = x
x = y
y = tmp
print(x,y,z)
tmp = x
x = z
z = tmp

print(x,y,z)


x,y,z = map(int,input().split())
print(y,end=' ')
print(x,end=' ')
print(z)


x,y,z = map(int,input().split())
print(z,end=' ')
print(y,end=' ')
print(x)


import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.IOException;
import java.util.StringTokenizer;

public class Main{
  public static void main(String[] args) throws IOException {
    BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st = new StringTokenizer(in.readLine());
    int X = Integer.parseInt(st.nextToken());
    int Y = Integer.parseInt(st.nextToken());
    int Z = Integer.parseInt(st.nextToken());

    int tmp = X;
    X = Y;
    Y = tmp;

    tmp = X;
    X = Z;
    Z = tmp;

    System.out.println(X + " " + Y + " " + Z);
  }
}


import java.io.*;
import java.lang.*;
import java.util.*;
public class Main{
    public static void main(String[] args) throws IOException{
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        String[] str=br.readLine().split(" ");
        int A=Integer.parseInt(str[0]);
        int B=Integer.parseInt(str[1]);
        int C=Integer.parseInt(str[2]);
        /* int[] f=new int[N+1];
        int[] arr=new int[N];
        StringTokenizer st=new StringTokenizer(br.readLine()," ");
        for(int i=0;i<N;i++){
        arr[i]=Integer.parseInt(st.nextToken());
        f[arr[i]]++;
        }
        long count=0;
        for(int i=1;i<=N;i++){
        long n=f[i];
        count=count+n*(n-1)/2;
        }
        for(int i=0;i<N;i++){
        int n=arr[i];
        int freq=f[n];
        System.out.println(count+1-freq);*/
        System.out.println(C+" "+A+" "+B);
    }
}


import java.io.IOException;
import java.io.InputStream;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.NoSuchElementException;
import java.util.concurrent.PriorityBlockingQueue;

public class Main {

    public static void main(String[] args) {
        FastScanner sc = new FastScanner();
        int x = sc.nextInt();
        int y = sc.nextInt();
        int z = sc.nextInt();

        System.out.println(z + " " + x + " "+ y);

    }

    private static class FastScanner {
        private final InputStream in = System.in;
        private final byte[] buffer = new byte[1024];
        private int ptr = 0;
        private int buflen = 0;

        private boolean hasNextByte() {
            if (ptr < buflen) {
                return true;
            } else {
                ptr = 0;
                try {
                    buflen = in.read(buffer);
                } catch (IOException e) {
                    e.printStackTrace();
                }
                if (buflen <= 0) {
                    return false;
                }
            }
            return true;
        }

        private int readByte() {
            if (hasNextByte())
                return buffer[ptr++];
            else
                return -1;
        }

        private static boolean isPrintableChar(int c) {
            return 33 <= c && c <= 126;
        }

        public boolean hasNext() {
            while (hasNextByte() && !isPrintableChar(buffer[ptr]))
                ptr++;
            return hasNextByte();
        }

        public String next() {
            if (!hasNext())
                throw new NoSuchElementException();
            StringBuilder sb = new StringBuilder();
            int b = readByte();
            while (isPrintableChar(b)) {
                sb.appendCodePoint(b);
                b = readByte();
            }
            return sb.toString();
        }

        public long nextLong() {
            if (!hasNext())
                throw new NoSuchElementException();
            long n = 0;
            boolean minus = false;
            int b = readByte();
            if (b == '-') {
                minus = true;
                b = readByte();
            }
            if (b < '0' || '9' < b) {
                throw new NumberFormatException();
            }
            while (true) {
                if ('0' <= b && b <= '9') {
                    n *= 10;
                    n += b - '0';
                } else if (b == -1 || !isPrintableChar(b)) {
                    return minus ? -n : n;
                } else {
                    throw new NumberFormatException();
                }
                b = readByte();
            }
        }

        public int nextInt() {
            long nl = nextLong();
            if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)
                throw new NumberFormatException();
            return (int) nl;
        }

        public double nextDouble() {
            return Double.parseDouble(next());
        }
    }

}


import java.util.*;

public class AtCoder_A{
	public static void main(String[] args) {
		Scanner input = new Scanner(System.in);
		int a = input.nextInt();
		int b = input.nextInt();
		int c = input.nextInt();
		System.out.println(c + " " + a + " " + b);
	}
}


import java.util.*;

public class AtCoder_A{
	public static void main(String[] args) {
		Scanner input = new Scanner(System.in);
		int a = input.nextInt();
		int b = input.nextInt();
		int c = input.nextInt();

		int swap = b;
		b = a;
		a = swap;

		a = c;
		c = swap;

		System.out.println(a + " " + b + " " + c);
	}
}