Problem:


Score : 100 points

Problem Statement

Snuke has a favorite restaurant.

The price of any meal served at the restaurant is 800 yen (the currency of Japan), and each time a customer orders 15 meals, the restaurant pays 200 yen back to the customer.

So far, Snuke has ordered N meals at the restaurant.
Let the amount of money Snuke has paid to the restaurant be x yen, and let the amount of money the restaurant has paid back to Snuke be y yen.
Find x-y.

Constraints

1 ≤ N ≤ 100

Input

The input is given from Standard Input in the following format:

N

Output

Print the answer.

Sample Input 1

20

Sample Output 1

15800

So far, Snuke has paid 16000 yen, and the restaurant has paid back 200 yen. Thus, the answer is 15800.

Sample Input 2

60

Sample Output 2

47200

Snuke has paid 48000 yen for 60 meals, and the restaurant has paid back 800 yen.



Sample input:
20


Sample output:
15800

Submission status: Runtime Error

Solution code:
n = int(input())

print(N * 800 - N // 15 * 200)

Submission status: Runtime Error

Solution code:
a=int(input())
print(800*n-(n//15)*200)

Submission status: Runtime Error

Solution code:
#include <iostream>
using namespace std;

int main() {
  int n;
  cin >> n;
  cout << n*800 - (n/15)*200 << endl;
}

Submission status: Runtime Error

Solution code:
#include <iostream>
using namespace std;

int main() {
  int n;
  cin >> n;
  cout << n*800 - n/15*200 << endl;
}

Submission status: Runtime Error

Solution code:
s=int(input())
print(i*800-(i//15)*200)

Submission status: Runtime Error

Solution code:
n=int(input())
can=n*800
p=n
des=200
if n>=15 and n<30:
  total=can-200
elif n>=30 and n<45:
  total=can-400
elif n>=45 and n<60:
  total=can-600
elif n>=60 and n<75:
  total=can-800
elif n>=75 and n<90:
  total=can-1000
elif n>=90 and n<=100:
  total=can-1200
print(total)

Submission status: Runtime Error

Solution code:
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/

import math
import statistics

n = int(input())
p = 600 * (n // 15) + 800 * (n - n // 15)
print(c)

Submission status: Runtime Error

Solution code:
a, b = map(str, input().split())
if a==b:
    print("H")
else:
    print("D")

Submission status: Runtime Error

Solution code:
n = input()
x = 800*n
y = 200*(n//15)
print(x*y)

Submission status: Runtime Error

Solution code:
N=input()
input(x)=800*N
y=int(input(200*N/15))
print(x-y)

Submission status: Runtime Error

Solution code:
n = int(input())
print((800 * n) - (200 * (n//15))

Submission status: Runtime Error

Solution code:
N = int(input())
print(N*500-200*(N//15)

Submission status: Runtime Error

Solution code:
def next_to_you(t,a):
	if a == "o":
		if t[-1] == "S":
			if  t[-2] == "W":
				return "W"
			elif t[-2] == "S":
				return "S"
		elif t[-1] == "W":
			if  t[-2] == "W":
				return "S"
			elif t[-2] == "S":
				return "W"
	elif a == "x":
		if t[-1] == "S":
			if  t[-2] == "W":
				return "S"
			elif t[-2] == "S":
				return "W"
		elif t[-1] == "W":
			if  t[-2] == "W":
				return "W"
			elif t[-2] == "S":
				return "S"



n = int(input())
s = input()
t1, t2, t3, t4 = "SS", "SW", "WS", "WW"

for i in range(1,n):
	t1 += next_to_you(t1,s[i])
	t2 += next_to_you(t2,s[i])
	t3 += next_to_you(t3,s[i])
	t4 += next_to_you(t4,s[i])

ans = -1
for i in [t1,t2,t3,t4]:
	if i[0] == i[-1]:
		ans = i[:n]
		break
print(ans)

Submission status: Runtime Error

Solution code:
print( 800*int(input()) - 200*(int(input()) // 15))

Submission status: Runtime Error

Solution code:
=int(input())

print(a*800-200*(a//15))

Submission status: Runtime Error

Solution code:
n-int(input());print(800*n-n//15*200)

Submission status: Runtime Error

Solution code:
print((int(input())+int(input()))*int(input())//2)

Submission status: Runtime Error

Solution code:
inputa = int(input())
inputb = input()
flag = 0
res = ""

for c in inputb:
  if c == "o":
    if flag % 2 == 0:
      res += "S"
    else:
      res += "W"
  else:
    res += "S"
    flag += 1

if inputb[0] == "o":
  if flag % 2 != 0:
    print(-1)
  else:
    print(res)
elif inputb[0] == "x":
  if flag % 2 != 1:
    print(-1)
  else:
    print(res)
else:
  print(res)

Submission status: Runtime Error

Solution code:
n=int(inpt())
x=800*n
y=(n//15)*200
print(x-y)

Submission status: Runtime Error

Solution code:
n=int(input())

k=n//15

print(int(800n-200k))

Submission status: Runtime Error

Solution code:
a = int(input())
b = a * 800
if a >= 15:
    c = (a // 15) * 200
print(b-c)

Submission status: Runtime Error

Solution code:
n = input()
print(800 * n - 200 * (n//15))

Submission status: Runtime Error

Solution code:
N = input()
x = N * 800
y = N / 15 * 200
print(x - y)

Submission status: Runtime Error

Solution code:
x = 800 * N
y = N / 15 * 200
price = x - y
print(price)

Submission status: Runtime Error

Solution code:
print(input()-(input()//15)*200)

Submission status: Runtime Error

Solution code:
print(input()-input()//15*200)

Submission status: Runtime Error

Solution code:
n=int(input());print(800*x-x//15*200)

Submission status: Runtime Error

Solution code:
n, m = map(int, input().split())

if m // 2 <= n:
    print(m // 2)
else:
    m -= n * 2
    print(n + m // 4)

Submission status: Runtime Error

Solution code:
N=int(input())
print int((N*800-(N/15)*200))

Submission status: Runtime Error

Solution code:
a=int(input)
print(800*a-200*(int(a/15)))

Submission status: Runtime Error

Solution code:
N=int(input())
x=int(N*800)
y=int(N//15*200)
print(eval(x-y))

Submission status: Runtime Error

Solution code:
N=int(input())
x=N*800
y=N//15*200
print(eval(x-y))

Submission status: Runtime Error

Solution code:
#include "bits/stdc++.h"
using namespace std;


/* macro */
#define rep(i,a,b) for(int i=a;i<b;i++)
#define revrep(i,a,b) for(int i = a; i > b; i--)
#define int long long
#define exist(s,e) ((s).find(e)!=(s).end())
#define all(v) (v).begin(), (v).end()
#define each(s,itr) for(auto (itr) = s.begin(); (itr) != s.end(); (itr)++)
#define sum(v) accumulate(all(v), (0LL))
#define sec second
#define fir first
#define pb push_back



/* alias */
template<class T> using vec = vector<T>;
typedef vector<int> vi;
typedef pair<int, int> pi;


/* constant */
//const int inf = pow(2, 62);
//const int mod = 1e9 + 7;
const int mod = 100000;
int dx[8]={1,0,-1,0,-1,1,-1,1};
int dy[8]={0,1,0,-1,-1,-1,1,1};



/* io_method */
int input(){int tmp;cin >> tmp;return tmp;}
string raw_input(){string tmp;cin >> tmp;return tmp;}
string readline(){string s;getline(cin, s);return s;}
template<class T> void printx(T n){cout << n;}
template<class T, class U> void printx(pair<T, U> p){cout << "(" << p.first << "," << p.second << ")";}
template<class T> void printx(vector<T> v){cout << "{";rep(i,0,v.size()){printx(v[i]);if(i != v.size()-1)printx(",");}cout << "}";}
template<class T> void print(T n){printx(n);cout << endl;}
template<class T> void print(set<T> s){cout << "{";each(s, e){if(e != s.begin()) printx(",");printx(*e);}cout << "}" << endl;}
template<class T, class U> void print(map<T, U> mp){cout << "{";each(mp, e){cout << "(" << e -> first << "," << e -> second << ")";}cout << "}" << endl;}


/* general_method */
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }




/* main */
int ceil(int a, int b){
    if(a % b == 0) return a /b;
    else return a /b + 1;
}


signed main(){

    cin.tie(0);
    ios::sync_with_stdio(false);

    
    int n = input();

    print(n * 800 - n/15 * 200);




    
    



    
    

    







   




    

    

    




    



    



    

 
    
    


    

    
   
    













}

Submission status: Runtime Error

Solution code:
N = input()
print 800 * N 200 * (N // 15)

Submission status: Runtime Error

Solution code:
n=input();print(n*800-n//15*200)

Submission status: Runtime Error

Solution code:
n = int(input())
print(800 * n - (n // 15) * 200

Submission status: Runtime Error

Solution code:
n = int(input())
print(800 * n - (n // 15) * 200

Submission status: Runtime Error

Solution code:
n=input();print n*800-n//15*200

Submission status: Runtime Error

Solution code:
n = (input())
print(800*n-n%15*200)

Submission status: Runtime Error

Solution code:
n = int(input())
p=1

for i in range(1,n+1):
    p*=i

print(a%(10**9+7))

Submission status: Runtime Error

Solution code:
n=int(input())
print(n*800-adder*200)

Submission status: Runtime Error

Solution code:
＃include<bits/stdc++.h>
using namespace std;

int main(){
  int N;
  cin >> N;
  x = N*800;
  Y = N/15;
  
  cout << x-y << endl;
}

Submission status: Runtime Error

Solution code:
＃include<bits/stdc++.h>
using namespace std;

int main(){
  int N;
  cin >> N
  cout << 800*N-N/15 << endl;
  }

Submission status: Runtime Error

Solution code:
＃include<bits/stdc++.h>
using namespace std;

int main(){
  int N;
  cin >> N
  cout << 800*N-N/15 << endl;

Submission status: Runtime Error

Solution code:
import math

N = int(input())
print(math.factorial(N) % MOD)

Submission status: Runtime Error

Solution code:
N = int(input())
p = N // 15
print(N*800 - P*200)

Submission status: Runtime Error

Solution code:
x = int(raw_input())
print(x*800 - (x/15) * 200)
#asdf#asdf#asdf#asdf#asdf#asdf#asdf#asdf#asdf#asdf#asdf

Submission status: Runtime Error

Solution code:
N = int(input())
if N > 15:
    discount = N // 15
print(N * 800 - discount * 200)

Submission status: Runtime Error

Solution code:
n = int(input())
print(800*n -(n%15)＊200)

Submission status: Runtime Error

Solution code:
a, b, c = map(int, raw_input().split())

if b - a == c - b:
    print "YES"
else:
    print "NO"

Submission status: Runtime Error

Solution code:
N,M=map(int,input().split())
ans=0
if N<M:
    ans=N+((M-(N*2))//4)
else:
    ans=M//2
print(ans)

Submission status: Runtime Error

Solution code:
n = int(input())
s = list(input())
for i in range(len(s)):
    if s[i] == 'o':
        s[i] = True
    else:
        s[i] = False

state = [None]*n
state[0] = 1
state[1] = 1


def next_predict(before_state,current_state,output):#i+1の動物を出力する
    if current_state == 1:
        if output == True:
            if before_state == 1:
                return 1
            else:
                return 0
        else:
            if before_state == 1:
                return 0
            else:
                return 1
    else:
        return next_predict(before_state,1,not(output))

isFound = -1
for i in range(4):
    for j in range(1,n-1):
        state[j+1] = next_predict(state[j-1],state[j],s[j])
    tmp0 = next_predict(state[n-2],state[n-1],s[n-1])
    if tmp0 == state[0]:
        tmp1 = next_predict(state[n-1],state[0],s[0])
        if tmp1 == state[1]:
            isFound = 1
            ans = []
            for k in range(n):
                if state[k] == 0:
                    ans.append('W')
                else:
                    ans.append('S')
            print("".join(ans))
            break
    else:
        if i == 0:
            state[1] = 0
        elif i == 1:
            state[0] = 0
        else:
            state[1] = 1

if isFound == -1:
    print(-1)

Submission status: Runtime Error

Solution code:
s, c = map(int, input().split())
ans = 0

if s<=2*c:
    c -= 2*s
    ans += s + c//4
else:
    ans += s

print (ans)

Submission status: Runtime Error

Solution code:
s_num, c_num = map(int, input().split())
if s_num * 2 > c_num:
    print(s_num)
else:
    ans = s_num
    c_num -= s_num * 2
    ans += c_num // 4
    print(ans)

Submission status: Runtime Error

Solution code:
N = int(input())
s = input()

b = [0 if si == 'o' else 1 for si in s]
sw = [0] * N

for i in range(4):
    sw[0] = i & 1
    sw[1] = (i >> 1) & 1

    for k in range(2, N):
        sw[k] = b[k - 1] ^ sw[k - 1] ^ sw[k - 2]

    if b[N - 1] != (sw[N - 2] ^ sw[N - 1] ^ sw[0]):
        continue
    if b[0] != (sw[N - 1] ^ sw[0] ^ sw[1]):
        continue

    ans = ['W' if si else 'S' for si in sw]
    print(''.join(ans))
    quit()

print(-1)

Submission status: Runtime Error

Solution code:
num = input()
get = num // 15

print((num * 800) - (get * 200))

Submission status: Runtime Error

Solution code:
num = input()
get = num / 15
print((num * 800) - (get * 200))

Submission status: Runtime Error

Solution code:
num = input()
get = num // 15
print(num * 800 - get * 200)

Submission status: Runtime Error

Solution code:
# -*- coding:utf-8 -*-
n = int(input())

r = int(n/15
print(n*800-r*200)

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
import sys
import math
# sys.setrecursionlimit(10000)


def main():
    # 入力処理
    N, M = map(int, input().split())

    # アルゴリズム本体
    K = int(M / 2)

    # 出力
    print(K)


if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
import sys
import math
# sys.setrecursionlimit(10000)


def main():
    # 入力処理
    N, M = map(int, input().split())

    # アルゴリズム本体
    K = N + int((M - 2 * N) / 4)

    # 出力
    print(K)


if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
import sys
import math
# sys.setrecursionlimit(10000)


def main():
    # 入力処理
    N, M = map(int, input().split())

    # アルゴリズム本体
    if N >= 2 * M:
        K = int(M / 2)
    else:
        K = N + int((M - 2 * N) / 4)

    # 出力
    print(K)


if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
#!/usr/bin/env python

n,m=map(int,raw_input().split())

if m<=2*n:
    print n+(m-2*n)/4
else:
    print m/2

Submission status: Runtime Error

Solution code:
s,c = map(int,input().split())
if c/2 <= s:
	print(c//2)
else:
	print(s + (c-s*2)//4)

Submission status: Runtime Error

Solution code:
# coding: utf-8

numbers=input().rstrip().split(" ")

num=0
s=int(numbers[0])
c=int(numbers[1])

while c>=2:
    if s>=1 and c>=2:
        num+=1
        s-=1
        c-=2
    
    elif  c>=2:
        s+=1
        c-=2

print(num)

Submission status: Runtime Error

Solution code:
N,M = map(int,input().split())
count = 0
while(1):
    if N>=1:
        if M>=2:
            N -= 1
            M -= 2
            count += 1
        else:
            break
    else:
        while(1):
            if M >= 4 :
                M -= 4
                count += 1
            else:
                break
        break
        
print(count)

Submission status: Runtime Error

Solution code:
N,M = map(int,input().split())
count = 0
while(1):
    if N>=1:
        if M>=2:
            N -= 1
            M -= 2
            count += 1
        else:
            break
    elif M >= 4 :
        M -= 4
        count += 1
    else:
        break
        
print(count)

Submission status: Runtime Error

Solution code:
N,M = map(int,input().split())
num_c = N*2 + M
num_Scc = num_c//4
print(num_Scc)

Submission status: Runtime Error

Solution code:
a = int(input())
b,c=map(int,input().split())
s=input()
print(str(a+b+c) + " " + s)

Submission status: Runtime Error

Solution code:
N=int(input())
ans=N*800-(N-N%15)*200/15
print ans

Submission status: Runtime Error

Solution code:
N=input()
print N*800-(N-N%15)*200/15

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-

N = input()
S = raw_input()
Ans = ''
StartString = ['SS','SW','WS','WW']
CheckFlag = 0
for i in range(4):
    Ans += StartString[i]
    for j in range(N-1):
        if(Ans[j+1]=='S' and S[j+1]=='o'):
            Ans += Ans[j]
        elif(Ans[j+1]=='S' and S[j+1]=='x'):
            if(Ans[j]=='S'):
                Ans += 'W'
            else:
                Ans += 'S'
        elif(Ans[j+1]=='W' and S[j+1]=='o'):
            if(Ans[j]=='S'):
                Ans += 'W'
            else:
                Ans += 'S'
        elif(Ans[j+1]=='W' and S[j+1]=='x'):
            Ans += Ans[j]
    if(Ans[0]==Ans[N]):
        print(Ans[:N])
        CheckFlag = 1
        break
    else:
        Ans = ''
        
if(CheckFlag == 0):
    print('-1')

Submission status: Runtime Error

Solution code:
N, M = map(int, raw_input().split())

if M - 2*N < 0:
  print N
else:
  print N + int((M - 2*N)/4)

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
def check(s, ans):
    if len(s) != len(ans):
        return False;
    for i in range(0, len(s)):
        pre = i - 1
        next = i + 1
        if i == 0:
            pre = len(s) - 1
        if i == len(s) - 1:
            next = 0
                
        if ans[i] == "S":
            if s[i] == "o":
                if ans[pre] != ans[next]:
                    return False
            else:
                if ans[pre] == ans[next]:
                    return False
        else:
            if s[i] == "x":
                if ans[pre] != ans[next]:
                    return False
            else:
                if ans[pre] == ans[next]:
                    return False
    return True
                                
def getAns(s, ans, idx, n):
    if idx == n - 1:
        if check(a, ans):
            return ans
        else:
            return []
    if idx == 0:
        if ans[idx] == "S":
            if s[idx] == "o":
                ans[n - 1] = ans[1]
            else:
                if ans[1] == "S":
                    ans[n - 1] = "W"
                else:
                    ans[n - 1] = "S"
        else:
            if s[idx] == "x":
                ans[n - 1] = ans[1]
            else:
                if ans[1] == "S":
                    ans[n - 1] = "W"
                else:
                    ans[n - 1] = "S"
        return getAns(s, ans, idx + 1, n)
    pre  = idx - 1
    next = idx + 1
    # 羊
    if ans[idx] == "S":
        if s[idx] == "o":
            ans[next] = ans[pre]
        else:
            if ans[pre] == "S":
                ans[next] = "W"
            else:
                ans[next] = "S"
    # 狼
    else:
        if s[idx] == "x":
            ans[next] = ans[pre]
        else:
            if ans[pre] == "S":
                ans[next] = "W"
            else:
                ans[next] = "S"
    return getAns(s, ans, idx + 1, n)

def arrayToString(arry):
    s = ""
    for i in range(0, len(arry)):
        s+= arry[i]
    return s

n = int(input())
a = input()
s = [a[i] for i in range(0, len(a))]
ans = ["S" for i in range(0, len(a))]
ans1 = ans[:]
ans1 = getAns(s, ans1, 0, n)
if len(ans1) != 0:
    print(arrayToString(ans1))
    quit()
ans2 = ans[:]
ans2[0] = "W"
ans2 = getAns(s, ans2, 0, n)
if len(ans2) != 0:
    print(arrayToString(ans2))
    quit()
ans3 = ans[:]
ans3[1] = "W"
ans3 = getAns(s, ans3, 0, n)
if len(ans3) != 0:
    print(arrayToString(ans3))
    quit()
ans4 = ans[:]
ans4[0] = "W"
ans4[1] = "W"
ans4 = getAns(s, ans4, 0, n)
if len(ans4) != 0:
    print(arrayToString(ans4))
    quit()
print("-1")

Submission status: Runtime Error

Solution code:
n = int(row())
print n

Submission status: Runtime Error

Solution code:
n = raw_input()

x = n * 800
y = (n / 15) * 200

print x-y

Submission status: Runtime Error

Solution code:
n = raw_input()

x = n * 800
y = (n % 15) * 200

print x-y

Submission status: Runtime Error

Solution code:
n, m = map(int, input() .split())

if n >= m//2:
	ans = m//2
else:
	ans = n + (m - 2 * n) // 4

print(ans)

Submission status: Runtime Error

Solution code:
n,m=map(int,input().split());print((min(2*n,m)+m)//4)

Submission status: Runtime Error

Solution code:
N = int(input())
s = input()

def lier_check(aa):
    lier = 1
    if aa==0:
        mae=N-1
    else:
        mae=aa-1
    if aa == N-1:
        ato = 0
    else:
        ato = aa+1
    
    if ans[aa] == 'S' and s[aa] == 'o':
        if ans[mae] != ans[ato]:
            lier = -1
    if ans[aa] == 'S' and s[aa] == 'x':
        if ans[mae] == ans[ato]:
            lier = -1
    if ans[aa] == 'W' and s[aa] == 'o':
        if ans[mae] == ans[ato]:
            lier = -1
    if ans[aa] == 'W' and s[aa] == 'x':
        if ans[mae] != ans[ato]:
            lier = -1 
    return(lier)


ans = ['X']*N
ans[0] = 'S'
if s[0] == 'o':
    ans[N-1] = 'S'
    ans[1] = 'S'
else:
    ans[N-1] = 'W'
    ans[1] = 'S'
for aa in range(1,N-1):
    if ans[aa] == 'S' and s[aa] == 'o' and ans[aa-1]=='S':
        ans[aa+1] = 'S'
    elif ans[aa] == 'S' and s[aa] == 'o' and ans[aa-1]=='W':
        ans[aa+1] = 'W'
    elif ans[aa] == 'S' and s[aa] == 'x' and ans[aa-1]=='S':
        ans[aa+1] = 'W'
    elif ans[aa] == 'S' and s[aa] == 'x' and ans[aa-1]=='W':
        ans[aa+1] = 'S'
    elif ans[aa] == 'W' and s[aa] == 'o' and ans[aa-1]=='S':
        ans[aa+1] = 'W'
    elif ans[aa] == 'W' and s[aa] == 'o' and ans[aa-1]=='W':
        ans[aa+1] = 'S'
    elif ans[aa] == 'W' and s[aa] == 'x' and ans[aa-1]=='S':
        ans[aa+1] = 'S'
    elif ans[aa] == 'W' and s[aa] == 'x' and ans[aa-1]=='W':
        ans[aa+1] = 'W'

kekka = 1
for aa in range(0,len(ans)):
    if(lier_check(aa) == -1):
        kekka = -1
        break
if kekka == 1:
    print("".join(ans))

    
######## 

ans = ['X']*N
ans[0] = 'S'
if s[0] == 'o':
    ans[N-1] = 'W'
    ans[1] = 'W'
else:
    ans[N-1] = 'W'
    ans[1] = 'S'
for aa in range(1,N-1):
    if ans[aa] == 'S' and s[aa] == 'o' and ans[aa-1]=='S':
        ans[aa+1] = 'S'
    elif ans[aa] == 'S' and s[aa] == 'o' and ans[aa-1]=='W':
        ans[aa+1] = 'W'
    elif ans[aa] == 'S' and s[aa] == 'x' and ans[aa-1]=='S':
        ans[aa+1] = 'W'
    elif ans[aa] == 'S' and s[aa] == 'x' and ans[aa-1]=='W':
        ans[aa+1] = 'S'
    elif ans[aa] == 'W' and s[aa] == 'o' and ans[aa-1]=='S':
        ans[aa+1] = 'W'
    elif ans[aa] == 'W' and s[aa] == 'o' and ans[aa-1]=='W':
        ans[aa+1] = 'S'
    elif ans[aa] == 'W' and s[aa] == 'x' and ans[aa-1]=='S':
        ans[aa+1] = 'S'
    elif ans[aa] == 'W' and s[aa] == 'x' and ans[aa-1]=='W':
        ans[aa+1] = 'W'

kekka = 1
for aa in range(0,len(ans)):
    if(lier_check(aa) == -1):
        kekka = -1
        break
if kekka == 1:
    print("".join(ans))
else:
    ############
    ans = ['X']*N
    ans[0] = 'S'
    if s[0] == 'o':
        ans[N-1] = 'S'
        ans[1] = 'S'
    else:
        ans[N-1] = 'S'
        ans[1] = 'W'
    for aa in range(1,N-1):
        if ans[aa] == 'S' and s[aa] == 'o' and ans[aa-1]=='S':
            ans[aa+1] = 'S'
        elif ans[aa] == 'S' and s[aa] == 'o' and ans[aa-1]=='W':
            ans[aa+1] = 'W'
        elif ans[aa] == 'S' and s[aa] == 'x' and ans[aa-1]=='S':
            ans[aa+1] = 'W'
        elif ans[aa] == 'S' and s[aa] == 'x' and ans[aa-1]=='W':
            ans[aa+1] = 'S'
        elif ans[aa] == 'W' and s[aa] == 'o' and ans[aa-1]=='S':
            ans[aa+1] = 'W'
        elif ans[aa] == 'W' and s[aa] == 'o' and ans[aa-1]=='W':
            ans[aa+1] = 'S'
        elif ans[aa] == 'W' and s[aa] == 'x' and ans[aa-1]=='S':
            ans[aa+1] = 'S'
        elif ans[aa] == 'W' and s[aa] == 'x' and ans[aa-1]=='W':
            ans[aa+1] = 'W'

    kekka = 1
    for aa in range(0,len(ans)):
        if(lier_check(aa) == -1):
            kekka = -1
            break
    if kekka == 1:
        print("".join(ans))
    else:

        #######
        ans = ['X']*N
        ans[0] = 'S'
        if s[0] == 'o':
            ans[N-1] = 'W'
            ans[1] = 'W'
        else:
            ans[N-1] = 'S'
            ans[1] = 'W'
        for aa in range(1,N-1):
            if ans[aa] == 'S' and s[aa] == 'o' and ans[aa-1]=='S':
                ans[aa+1] = 'S'
            elif ans[aa] == 'S' and s[aa] == 'o' and ans[aa-1]=='W':
                ans[aa+1] = 'W'
            elif ans[aa] == 'S' and s[aa] == 'x' and ans[aa-1]=='S':
                ans[aa+1] = 'W'
            elif ans[aa] == 'S' and s[aa] == 'x' and ans[aa-1]=='W':
                ans[aa+1] = 'S'
            elif ans[aa] == 'W' and s[aa] == 'o' and ans[aa-1]=='S':
                ans[aa+1] = 'W'
            elif ans[aa] == 'W' and s[aa] == 'o' and ans[aa-1]=='W':
                ans[aa+1] = 'S'
            elif ans[aa] == 'W' and s[aa] == 'x' and ans[aa-1]=='S':
                ans[aa+1] = 'S'
            elif ans[aa] == 'W' and s[aa] == 'x' and ans[aa-1]=='W':
                ans[aa+1] = 'W'

        kekka = 1
        for aa in range(0,len(ans)):
            if(lier_check(aa) == -1):
                kekka = -1
                break
        if kekka == 1:
            print("".join(ans))
        else:
            print(kekka)

Submission status: Runtime Error

Solution code:
import sys
N = int(input())
ipt = list(input())
stR = ["S" for i in range(N)]

def sheep(stg):
     return stg
def wolf(stg):
    if stg == "S":
        return "W"
    else:
        return "S"
def modN (i):
    return i%N
def check ( num1,num2 ):
    
    for i in range(N+2):
        if stR[modN(i+1)] == "S" and ipt[modN(i+1)]=="o"  :
            stR[modN(i+2)]=sheep(stR[modN(i)])
        elif stR[modN(i+1)] == "W" and ipt[modN(i+1)]=="x":
            stR[modN(i+2)]=sheep(stR[modN(i)])
        else:
            stR[modN(i+2)]=wolf(stR[modN(i)])
    
    if stR[0]==num1 and stR[1]==num2:
        print("".join(stR))
        return True
    else:
        return False

if check("S","W"):
    sys.exit()
else:
    stR[0]="W"
    if check("W","W"):
        sys.exit()
    else:
        stR[1]="S"
        if check("W","S"):
            sys.exit()
        else:
            stR[0]="S"
            if check("S","S"):
                sys.exit()
            else:
                print(-1)

Submission status: Runtime Error

Solution code:
N = int(input())
s = str(input())
ss = s

if N%2 == 1:
    s += s[0]
if s[:len(s)/2]*2 != s:
    print(-1)
else:
    ans = ''
    Flag = 0
    for c in ss:
        if Flag == 0:
            ans += 'S'
            if c == 'x':
                Flag = 1
        else:
            if c == 'x':
                ans += 'S'
                Flag = 0
            else:
                ans += 'W'
    print(ans)

Submission status: Runtime Error

Solution code:
SHEEP = True
WOLF = False


def print_tree(tree):
    print(''.join(['S' if e else 'W' for e in tree]))


def calc_next_animal(tree, cur_pos):
    if answer[cur_pos]:
        if tree[cur_pos] == SHEEP:
            return tree[cur_pos - 1]
        else:
            return not tree[cur_pos - 1]
    else:
        if tree[cur_pos] == SHEEP:
            return not tree[cur_pos - 1]
        else:
            return tree[cur_pos - 1]


def calc_prev_animal(tree, cur_pos):
    if answer[cur_pos]:
        if tree[cur_pos] == SHEEP:
            return tree[cur_pos + 1]
        else:
            return not tree[cur_pos + 1]
    else:
        if tree[cur_pos] == SHEEP:
            return not tree[cur_pos + 1]
        else:
            return tree[cur_pos + 1]


def wfs(tree, cur_pos, N):
    tree[cur_pos + 1] = calc_next_animal(tree, cur_pos)
    cur_pos += 1
    if cur_pos == N - 1:
        return tree[0] == calc_next_animal(tree, cur_pos) and tree[cur_pos] == calc_prev_animal(tree, 0)
    else:
        return wfs(tree, cur_pos, N)


if __name__ == '__main__':
    N = int(input())
    answer = [True if i == 'o' else False for i in input().rstrip()]
    aa = [[WOLF, WOLF]
        , [WOLF, SHEEP]
        , [SHEEP, SHEEP]
        , [SHEEP, WOLF]]
    super_list = [0] * int(2E5)
    for a in aa:
        super_list[:2] = a
        if wfs(super_list, 1, N):
            print_tree(super_list[:N])
            break
    else:
        print(-1)

Submission status: Runtime Error

Solution code:
N = int(input())
t = list(input())
Ans = ['n' for _ in t]

def judge(prevSW, SW, ox):
    if SW == 'S':
        if ox == 'o':
            return prevSW
        else:
            if prevSW == 'S':
                return 'W'
            else: return 'S'
    elif SW == 'W':
        if ox == 'x':
            return prevSW
        else:
            if prevSW == 'S':
                return 'W'
            else: return 'S'

def decideorder(startSW):
    Ans[1] = startSW
    for i in range(2,N):
        Ans[i] = judge(Ans[i-2], Ans[i-1], t[i-1])


Ans[0] = 'S'
decideorder('S')
if judge(Ans[-1], Ans[0], t[0]) is Ans[0]:
    print("".join(Ans))
else:
    decideorder('W')
    if judge(Ans[-1], Ans[0], t[0]) is Ans[0]:
        print("".join(Ans))
    else:
        Ans[0] = 'W'
        decideorder('S')
        if judge(Ans[-1], Ans[0], t[0]) is Ans[0]:
            print("".join(Ans))
        else:
            decideorder('W')
            if judge(Ans[-1], Ans[0], t[0]) is Ans[0]:
                print("".join(Ans))
            else:
                print(-1)

Submission status: Runtime Error

Solution code:
def sunuke_f(n) :
    x = n * 800
    y = (n // 15) * 200
    return(x-y)
sunuke_f(N)

Submission status: Runtime Error

Solution code:
800*N-15%N*200

Submission status: Runtime Error

Solution code:
 = int(input())

print(N * 800 - ((N // 15) * 200))

Submission status: Runtime Error

Solution code:
N = input()

print(N / 15)

print(N * 800 - ((N / 15) * 200))

Submission status: Runtime Error

Solution code:
def sunuke_f(n) :
  x = n * 800
  y = n // 15 * 200
  return(x-y)
sunuke_f(N)

Submission status: Runtime Error

Solution code:
import sys
N = int(sys.argv[1])
x = 800*N
y = (N/15)*200
print x - y

Submission status: Runtime Error

Solution code:
import sys
N = int(sys.argv[1])
assert(1 <= N <= 100)
x = 800*N
y = (N/15)*200
print x - y