Problem:


Score : 100 points

Problem Statement

There are N students in a school.

We will divide these students into some groups, and in each group they will discuss some themes.

You think that groups consisting of two or less students cannot have an effective discussion, so you want to have as many groups consisting of three or more students as possible.

Divide the students so that the number of groups consisting of three or more students is maximized.

Constraints

1 \leq N \leq 1000

All input values are integers.

Input

Input is given from Standard Input in the following format:

N

Output

If you can form at most x groups consisting of three or more students, print x.

Sample Input 1

8

Sample Output 1

2

For example, you can form a group of three students and another of five students.

Sample Input 2

2

Sample Output 2

0

Sometimes you cannot form any group consisting of three or more students, regardless of how you divide the students.

Sample Input 3

9

Sample Output 3

3



Sample input:
8


Sample output:
2

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline
ra = range
enu = enumerate


def read_ints():
    return list(map(int, read().split()))


def read_a_int():
    return int(read())


def read_tuple(H):
    '''
    H is number of rows
    '''
    ret = []
    for _ in range(H):
        ret.append(tuple(map(int, read().split())))
    return ret


def read_col(H):
    '''
    H is number of rows
    A列、B列が与えられるようなとき
    ex1)A,B=read_col(H)    ex2) A,=read_col(H) #一列の場合
    '''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return tuple(map(list, zip(*ret)))


def read_matrix(H):
    '''
    H is number of rows
    '''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return ret
    # return [list(map(int, read().split())) for _ in range(H)] # 内包表記はpypyでは遅いため


MOD = 10**9 + 7
INF = 2**31  # 2147483648 > 10**9
# default import
from collections import defaultdict, Counter, deque
from operator import itemgetter
from itertools import product, permutations, combinations
from bisect import bisect_left, bisect_right  # , insort_left, insort_right

# https://atcoder.jp/contests/abc089/tasks/abc089_a

N = read_a_int()
print(N // 3)

Submission status: Accepted

Solution code:
def main():
    import sys
    input = sys.stdin.readline
    N = int(input())
    print(N//3)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def resolve():
  n = int(input())
  print(n // 3)
  return

if __name__ == "__main__":
  resolve()

Submission status: Accepted

Solution code:
def main():
    N = int(input())
    a, b = divmod(N, 3)
    print(a)
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import math
n=int(input())
print('{:.0f}'.format(math.floor(n/3)))

Submission status: Accepted

Solution code:
import sys
## io
IS = lambda: sys.stdin.readline().rstrip()
II = lambda: int(IS())
MII = lambda: list(map(int, IS().split()))
MIIZ = lambda: list(map(lambda x: x-1, MII()))
## dp
INIT_VAL = 0
DP2 = lambda d1, d2: [[INIT_VAL]*d2 for _ in range(d1)]
DP3 = lambda d1, d2, d3: [[[INIT_VAL]*d3 for _ in range(d2)] for _ in range(d1)]

def main():
    n = II()
    print(n//3)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N  = int(input())
print(N//3)

Submission status: Accepted

Solution code:
N = int(input())

print(N // 3)

Submission status: Accepted

Solution code:
N = int(input())
print( N // 3)

Submission status: Accepted

Solution code:
        
icase=0    
if icase==0:
    n=int(input())
    print(n//3)

Submission status: Accepted

Solution code:
n = int(input())
if n < 3:
    print (0)
elif n == 3:
    print (1)
else:
    a = n//3
    print (a-1) if n-a <= 2 else print (a)

Submission status: Accepted

Solution code:
def resolve():
    A = int(input())
    print(A // 3)


if '__main__' == __name__:
    resolve()

Submission status: Accepted

Solution code:
n =int(input())
print(n //3)

Submission status: Accepted

Solution code:
# Python3 (3.4.3)
import sys
input = sys.stdin.readline

# -------------------------------------------------------------
# function
# -------------------------------------------------------------


# -------------------------------------------------------------
# main
# -------------------------------------------------------------
N = int(input())

print(N//3)

Submission status: Accepted

Solution code:
def main():
    n = int(input())
    
    print(n//3)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s=int(input())
print(s//3)

Submission status: Accepted

Solution code:
url = "https://atcoder.jp/contests/abc089/tasks/abc089_a"

def main():
    n = int(input())

    ans = n / 3
    print(int(ans))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n = int(input())
res = n // 3
print(res)

Submission status: Accepted

Solution code:
N = int(input())
print(str(N // 3))

Submission status: Accepted

Solution code:
N=int(input())
print(int((N-(N%3))/3))

Submission status: Accepted

Solution code:
n = int(input())

a = n // 3
print(a)

Submission status: Accepted

Solution code:

n = int(input())
print(n // 3)

Submission status: Accepted

Solution code:
import math
N=int(input())
print(math.floor(N/3))

Submission status: Accepted

Solution code:
# coding: utf-8
import math

N = int(input())
ans = math.floor(N / 3)
print(ans)

Submission status: Accepted

Solution code:
import itertools
def main():
  x = int(input())
  print(x//3)
if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:
n= int(input())

print(n//3)

Submission status: Accepted

Solution code:
import sys

n = int(sys.stdin.readline().rstrip())

def main():
    print(n // 3)

if __name__ ==  '__main__':
    main()

Submission status: Accepted

Solution code:
# ABC 089: A – Grouping 2
n = int(input())
print(n // 3)

Submission status: Accepted

Solution code:
N = int(input())

print ( N //3 )

Submission status: Accepted

Solution code:
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

if __name__ == '__main__':
    a = int(input())

    print(a//3)

Submission status: Accepted

Solution code:
n = int(input())
ans = n//3
mod = n%3
print(max(0, ans))

Submission status: Accepted

Solution code:
import math

a=int(input())
print(a//3)

Submission status: Accepted

Solution code:
num = int(input())
if num < 3:
  ans = 0
else:
  ans = num//3
print(int(ans))

Submission status: Accepted

Solution code:
def main():
    n = int(input())
    ans = n // 3
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
n = int(input())
if n < 3:
  print(0)
else:
  print(int(n//3))

Submission status: Accepted

Solution code:
n=int(input())
cnt=0
while n>2:
  cnt+=1
  n-=3
print(cnt)

Submission status: Accepted

Solution code:
# | Its_Rashid | #
a = int(input())
print(a // 3)

Submission status: Accepted

Solution code:
import math

n=int(input())

ans=math.floor(n/3)
print(ans)

Submission status: Accepted

Solution code:
N=int(input())
a=N//3
print(a)

Submission status: Accepted

Solution code:
N=int(input())
import math
print(math.floor(N/3))

Submission status: Accepted

Solution code:
n = int(input())
ret = n//3
if(n/3 == 0):
    ret += 1

print(ret)

Submission status: Accepted

Solution code:
#abc089 a 
n=int(input())
print(n//3)

Submission status: Accepted

Solution code:
def abc089_a(n):

    return n//3

def main():
    n = int(input())
    print(abc089_a(n))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#pypyは内包表記使わない
def main():
    import sys
    #input = sys.stdin.readline
    sys.setrecursionlimit(10000000)
    from collections import Counter, deque
    #from collections import defaultdict
    from itertools import combinations, permutations
    #from itertools import accumulate, product
    from bisect import bisect_left,bisect_right
    from math import floor, ceil
    #from operator import itemgetter

    #mod = 1000000007

    N = int(input())
    print(N//3)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))

def main():
    N = INT()
    print(N//3)

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# Author: cr4zjh0bp
# Created: Thu Mar 12 19:39:28 UTC 2020
import sys
 
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
 
ni = lambda: int(ns())
nin = lambda y: [ni() for _ in range(y)]
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda y: [na() for _ in range(y)]
nf = lambda: float(ns())
nfn = lambda y: [nf() for _ in range(y)]
nfa = lambda: list(map(float, stdin.readline().split()))
nfan = lambda y: [nfa() for _ in range(y)]
ns = lambda: stdin.readline().rstrip()
nsn = lambda y: [ns() for _ in range(y)]
ncl = lambda y: [list(ns()) for _ in range(y)]
nas = lambda: stdin.readline().split()

N = ni()

print(N // 3)

Submission status: Accepted

Solution code:
import sys
import os


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    N = int(sys.stdin.readline().rstrip())
    print(N//3)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
x=int(input())
print(x//3)

Submission status: Accepted

Solution code:
import math
N = int(input())

print(math.floor(N/3))

Submission status: Accepted

Solution code:
import math
n = int(input())
ans = n / 3

ans = int(ans)

print(ans)

Submission status: Accepted

Solution code:
# A - Grouping 2
n=int(input())
print(n//3)

Submission status: Accepted

Solution code:
# import bisect
# from collections import Counter, defaultdict, deque
# import copy
# from heapq import heappush, heappop, heapify
# from fractions import gcd
# import itertools
# from operator import attrgetter, itemgetter
# import math

import sys

# import numpy as np

ipti = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)

def main():
    n = int(input())
    print(n//3)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
print(int(input()) // 3)

Submission status: Accepted

Solution code:
import math
n = int(input())

print(math.floor(n/3))

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
N = int(input())

print(N // 3)

Submission status: Accepted

Solution code:
#089_A
print(int(input())//3)

Submission status: Accepted

Solution code:
N = input()
N = int(N)
print(N // 3)

Submission status: Accepted

Solution code:
n=int(input())
print(int(n//3))

Submission status: Accepted

Solution code:
n=int(input())
rem=n%3
cnt=(n-rem)//3
print(cnt)

Submission status: Accepted

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

N = int(input().strip())

print(N // 3)

Submission status: Accepted

Solution code:
#%%
n = int(input())
print(n//3)

Submission status: Accepted

Solution code:
N = input()
print N/3

Submission status: Accepted

Solution code:
n=input()
print n/3

Submission status: Accepted

Solution code:
a=input()
a=int(a)
print(a//3)

Submission status: Accepted

Solution code:
print(eval(input() + "//3"))

Submission status: Accepted

Solution code:
N = int(input())
print( N // 3 )

Submission status: Accepted

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

print(N // 3)

Submission status: Accepted

Solution code:
import math
#import numpy


def readints():
    return list(map(int, input().split()))


n = int(input())
if n == 0:
    print(0)
    exit()

print(n//3)

Submission status: Accepted

Solution code:
# import numpy as np
# import scipy as sp
# import sys
# input = sys.stdin.readline
# print(a,b,c,sep="") # 半角スペースなしで出力(abc)
# n=int(input())  #数値入力 「N」だけの入力のとき
# a,b=map(int, input().split())  #複数数値入力　「A B」みたいなスペース空いた入力のとき
# a=list(map(int, input().split()))  #リスト入力 「a1 a2 a3 ...」みたいな配列のような入力のとき
# a=[int(input()) for _ in range (n)]  #リスト入力  改行でa1 ... anのとき
# s=[list(map(str,list(input()))) for i in range(h)]  # 文字列の二次元配列入力
# s = [list(map(int, input().split())) for i in range(n)] # 数値の二次元配列入力
# a = b[:], a = [x[:] for x in b] # deepcopy
# chr(ord('a') + 1) # chrのインクリメント
# s.sort(key=lambda x: x[1], reverse=False) # 2番目の要素で昇順にソート（Trueなら降順）
#　

n = int(input())
print(n//3)

Submission status: Accepted

Solution code:
def main():
    print(int(input()) // 3)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def main():
  n=int(input())
  print(n//3)
main()

Submission status: Accepted

Solution code:
# 入力 : 数字1つ
N = int(input())

# 出力 x
print(int(N/3))

Submission status: Accepted

Solution code:
n = int(input())
print (n//3)

Submission status: Accepted

Solution code:
N = int(input())
divN = int(N / 3)
print(divN)

Submission status: Accepted

Solution code:
n = int(input())
print(int(n / 3))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-


def main():
    N = int(input())
    print(N // 3)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import math
n=int(input())
print(math.floor(n/3))

Submission status: Accepted

Solution code:
"""
author : halo2halo
date : 24, Jan, 2020
"""

import sys
import itertools

# import numpy as np

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

A = int(readline().decode('utf8'))

print(A//3)

Submission status: Accepted

Solution code:
n=int(input())
n=n//3
print(n)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
print(int(input()) //3)

Submission status: Accepted

Solution code:
x = int(input())
print(int(x/3))

Submission status: Accepted

Solution code:
n = int(input())

a, b = divmod(n, 3)
if n < 3:
	print(0)
else:
	print(a)

Submission status: Accepted

Solution code:
n = int(input())
count = 0

while n >= 3:
    n -= 3
    count += 1

print(count)

Submission status: Accepted

Solution code:


import numpy as np

n=int(input())
print(n//3)

Submission status: Accepted

Solution code:
N = int(input())
print(int(N//3))

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
N = int(input())
if N < 3 :
    print(0)
else :
    print(N//3)

Submission status: Accepted

Solution code:
print(int(int(input()) / 3))

Submission status: Accepted

Solution code:
import math
import queue
import bisect
import heapq
import time
import itertools

mod = int(1e9+7)

def swap(a,b):
    return (b,a)

def my_round(a,dig=0):
    p = 10 ** dig
    return (a * p * 2 + 1) // 2 / p

def gcd(a,b): #最大公約数
    if (a<b):
        a,b = swap(a,b)
    if (b==0):
        return a
    else:
        return gcd(b,a%b)

def lcm(a,b): #最小公倍数
    return a/gcd(a,b)*b

def divisors(a): # 約数列挙
    divisors = []
    for i in range(1,int(a**0.5)+1):
        if a%i==0:
            divisors.append(i)
            if i!=a//i:
                divisors.append(a//i)
    return divisors

def is_prime(a): #素数判定
    if a<2:
        return False
    elif a==2:
        return True
    elif a%2==0:
        return False
    sqrt_num = int(a**0.5)
    for i in range(3,sqrt_num+1,2):
        if a%i==0:
            return False
    return True

def prime_num(a): #素数列挙
    pn = [2]
    for i in range(3,int(a**0.5),2):
        prime = True
        for j in pn:
            if i%j==0:
                prime = False
                break
        if prime:
            pn.append(i)
    return pn

def prime_fact(a): #素因数分解
    sqrt = math.sqrt(a)
    res = []
    i = 2
    if is_prime(a):
        res.append(a)
    else:
        while a!=1:
            while a%i==0:
                res.append(i)
                a //= i
            i += 1
    return res

def main():
    n = int(input())
    print(n//3)
    return

if __name__=='__main__':
    main()

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
N=int(input())
print(N//3)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
N = int(input())
print(N//3)

Submission status: Accepted

Solution code:

n = int(input())
print(n//3)

Submission status: Accepted

Solution code:
n = int(input())

print(int(n/3))

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
N = int(input())
print(N // 3)

Submission status: Accepted

Solution code:
n = int(input())
a = 0
a = n/3

print(int(a))

Submission status: Accepted

Solution code:
hito=int(input())
ninn=hito//3
print(ninn)

Submission status: Accepted

Solution code:
n = int(input())
if n < 3:
  print(0)
else:
  print(n//3)

Submission status: Accepted

Solution code:
import sys

n = int(sys.stdin.readline().rstrip())

def main():
    return n // 3

if __name__ == '__main__':
    ans = main()
    print(ans)

Submission status: Accepted

Solution code:
from sys import stdin


def fetch_one_line():
    return stdin.readline().rstrip()


def fetch_int_input():
    return [int(s) for s in fetch_one_line().split()]


def fetch_inputs(times):
    return [fetch_one_line() for _ in range(times)]


def fetch_int_inputs(times):
    return [[int(s) for s in fetch_one_line()] for _ in range(times)]

num = int(fetch_one_line())

print(int(num / 3))

Submission status: Accepted

Solution code:
a=int(input())
if a<3:
  print(0)
elif a%3==0:
  print(a//3)
elif a%3==1:
  print((a-1)//3)
else:
  print((a-2)//3)

Submission status: Accepted

Solution code:
import math

n = int(input())
print(n // 3)

Submission status: Accepted

Solution code:
N = int( input() )
print( N // 3 )

Submission status: Accepted

Solution code:
n=int(input())

print(n//3)

Submission status: Accepted

Solution code:
n = int(input())
if n <= 2:
    print(0)
else:
    print(n//3)

Submission status: Accepted

Solution code:
import math

n=int(input())

print(int(math.floor(n/3)))

Submission status: Accepted

Solution code:
n = int(input())

print((n - n % 3) // 3)

Submission status: Accepted

Solution code:
h =int(input())

print(int(h/3))

Submission status: Accepted

Solution code:
print(int(input())//3)

Submission status: Accepted

Solution code:
n = int(input())
ans = n //3
print(ans)

Submission status: Accepted

Solution code:
# ABC089a
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

n = int(input())
print(n//3)

Submission status: Accepted

Solution code:
N = int(input())
G = N // 3
print(G)

Submission status: Accepted

Solution code:
print(int(int(input()) / 3 ))

Submission status: Accepted

Solution code:
N = int(input())
print(int(N/3))

Submission status: Accepted

Solution code:
N = input ()
N = int (N)
print (N//3)

Submission status: Accepted

Solution code:
n=input()
n=int(n)
print(n//3)

Submission status: Accepted

Solution code:
N=input()

N=int(N)

n=N//3

print(n)

Submission status: Accepted

Solution code:
n=input()
n=int(n)
print (n//3)

Submission status: Accepted

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

print(n//3)

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

N = INT()
print(N//3)

Submission status: Accepted

Solution code:
size = int(input())
print(size//3)

Submission status: Accepted

Solution code:
n = int(input().split()[0])
print(n // 3)

Submission status: Accepted

Solution code:
##### 解けた #####

N=int(input())

print(N//3)

Submission status: Accepted

Solution code:
#89a
print(int(input())//3)

Submission status: Accepted

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

#入力
#S = str(input())
#a, b = map(int, input().split())
N = int(input())


if N >= 3 :
  print (math.floor(N/3))
else :
  print (0)

Submission status: Accepted

Solution code:
def examA():
    N = I()
    ans = N//3
    print(ans)


import sys,copy,bisect,itertools,heapq,math
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

examA()

Submission status: Accepted

Solution code:
n = int(input())
if n % 3 == 0:
  print(int(n / 3))
else:
  print(int(n / 3))

Submission status: Accepted

Solution code:
from sys import stdin
import numpy as np
import math

n = int(stdin.readline().rstrip())

print(n//3)

Submission status: Accepted

Solution code:
n = int(input())
if n % 3 == 0:
	print (int(n/3))
else:
	print (n//3)

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 6)
input = sys.stdin.readline
int1 = lambda x: int(x) - 1

def main():
    n=int(input())
    print(n//3)

main()

Submission status: Accepted

Solution code:
N = int(input())
 
if N % 3 == 0:
  print(int(N/3))
else:
  print(int(N//3))

Submission status: Accepted

Solution code:
#Grouping 2
N = int(input())
print(N//3)

Submission status: Accepted

Solution code:
#                         author:  kagemeka 
#                         created: 2019-11-06 16:52:04(JST)
import sys
# import collections
# import math
# import string
# import bisect
# import re
# import itertools 
# import statistics

def main():
    n = int(sys.stdin.readline().rstrip())
    ans = n // 3
    print(ans)


if __name__ == "__main__":
    # execute only if run as a script
    main()

Submission status: Accepted

Solution code:
x = int(input())

print(x//3)

Submission status: Accepted

Solution code:
N = int(input())

div = N // 3
print(div)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
N = int(input())
print(int(N/3))

Submission status: Accepted

Solution code:
# A - Grouping 2
n = int(input())
print(n // 3)

Submission status: Accepted

Solution code:
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    n=INT()
    print(int(n/3))
if __name__ == '__main__':
    do()

Submission status: Accepted

Solution code:
n = int(input())
print(n//3 if n>=3 else 0)

Submission status: Accepted

Solution code:
n = int(input())
print(0 if n<3 else n // 3)

Submission status: Accepted

Solution code:
N=int(input())

print(N//3)

Submission status: Accepted

Solution code:
import math

n = int(input())
print(math.floor(n/3))

Submission status: Accepted

Solution code:
def slove():
    import sys
    input = sys.stdin.readline
    n = int(input().rstrip('\n'))
    print(n // 3)


if __name__ == '__main__':
    slove()

Submission status: Accepted

Solution code:
def aa089():
    n = int(input())
    if n <= 2:
        print(0)
    else:
        print(int(n/3))

aa089()

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


def main():
    n = int(input())
    print(n // 3)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
X=int(input())

print(X//3)

Submission status: Accepted

Solution code:
# ABC089 A - Grouping 2
N = int(input())
print(N//3)

Submission status: Accepted

Solution code:
s = int(input())
if s<3:
  print(0)
elif s%3 == 0:
  print(s//3)
elif s%3 == 1:
  print((s//3))
else:
  print((s//3))

Submission status: Accepted

Solution code:
a = int(input())
print(int(a/3))

Submission status: Accepted

Solution code:
N = int(input())
if N < 3:
    print(0)
elif N//3 == 0:
    print(3)
else:
    print(N//3)

Submission status: Accepted

Solution code:
#2019/09/24
N = int(input())
print(N//3)

Submission status: Accepted

Solution code:
N = int(input())

x = int(N / 3)
print(x)

Submission status: Accepted

Solution code:
n = int(input())
print(int(n//3))

Submission status: Accepted

Solution code:
n=int(input());print(n//3)

Submission status: Accepted

Solution code:
n = int(input())
ans = 0
while n > 2:
  n -= 3
  ans += 1
print(ans)

Submission status: Accepted

Solution code:
# ARC 089 A

def resolve():
  n = int(input())
  print(n // 3)


if __name__ == "__main__":
    resolve()

Submission status: Accepted

Solution code:
print(int(input().strip())//3)

Submission status: Accepted

Solution code:
N =int(input())
print(N//3)

Submission status: Accepted

Solution code:
N = int(input())

N = int(N/3)

print(N)

Submission status: Accepted

Solution code:
a=int(input())
ans=int(a/3)
print(ans)

Submission status: Accepted

Solution code:
import math

n = int(input())
print(math.floor(n/3))

Submission status: Accepted

Solution code:
import sys

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
    
n=int(input())

print(n//3)

Submission status: Accepted

Solution code:
#coding:utf-8
n = int(input())
print(n//3)

Submission status: Accepted

Solution code:

print(int(input()) // 3)

Submission status: Accepted

Solution code:
def func():
    cnt = 0
    def m(n):
        nonlocal cnt

        if n < 3:
            return cnt
        if n != 0:
            cnt += 1

        m(n-3)
        return cnt
    return m

n=int(input())

f=func()
print(f(n))

Submission status: Accepted

Solution code:
n = int(input())
print(n // 3)

Submission status: Accepted

Solution code:
N = int(input())
groups = 0
for i in range(2, N, 3):
    groups += 1
print(groups)

Submission status: Accepted

Solution code:
from collections import deque
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline

def solve():
  n = int(input())
  print(n//3)
solve()

Submission status: Accepted

Solution code:
import sys
import math
from fractions import gcd
# import queue
# from collections import Counter
# from itertools import accumulate
# from functools import reduce

def lcm(a, b):
    return a * b // gcd(a, b)

def combination_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

def permutations_count(n, r):
    return math.factorial(n) // math.factorial(n - r)

big_prime = 1000000007

"""
# 標準入力取得
## 文字列
 =  sys.stdin.readline().rstrip()
 =  list(sys.stdin.readline().rstrip())

## 数値
 =  int(sys.stdin.readline())
 =  map(int, sys.stdin.readline().split())
 =  list(map(int, sys.stdin.readline().split()))
 =  [list(map(int,list(sys.stdin.readline().split()))) for i in range(N)]
"""


N = int(sys.stdin.readline())

print(N // 3)

Submission status: Accepted

Solution code:
n = int(input())
if 1 <= n <= 1000:
    print(n // 3)
else:
    print('hoge!')

Submission status: Accepted

Solution code:
import math
a=int(input())
print(math.floor(a/3))

Submission status: Accepted

Solution code:
ans = 0
num = int(input())

while(1):
  if num>=3:
    ans += 1
    num -= 3
  else:
    break
    
print(ans)

Submission status: Accepted

Solution code:
N = int(input())

print(int(N / 3))

Submission status: Accepted

Solution code:
n = int(input())
print(n//3)

Submission status: Accepted

Solution code:
import sys
from statistics import *
from collections import *
from operator import itemgetter
stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()

n = ni()
print(n // 3)

Submission status: Accepted

Solution code:
N = int(input())
r = N//3
print(r)

Submission status: Accepted

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

print(int(input())//3)

Submission status: Accepted

Solution code:
def resolve():
    print(int(input()) // 3)


if __name__ == "__main__":
    resolve()

Submission status: Accepted

Solution code:
n = int(input())
print(int((n)/3))

Submission status: Accepted

Solution code:
n = int(input())
print( n// 3)

Submission status: Accepted

Solution code:
n=int(input())

ans=0
if n<3:
  print(0)
  exit()
while True:
  ans+=1
  if n-3>=3:
    n=n-3
  else:
    break
print(ans)

Submission status: Accepted

Solution code:
N=int(input())
print((N-N%3)//3)

Submission status: Accepted

Solution code:
def main():
    N = int(input())
    return N // 3

if __name__ == '__main__':
    print(main())

Submission status: Accepted

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

N = int(input())

print(N // 3)

Submission status: Accepted

Solution code:
print(int(input()) //3)

Submission status: Accepted

Solution code:
N = int(input())
N = int(N / 3)

print(N)

Submission status: Accepted

Solution code:
def test():
    n = int(input())
    print(int(n/3))


if __name__ == "__main__":
    test()

Submission status: Accepted

Solution code:
n = int(input())

print(n//3)

Submission status: Accepted

Solution code:
n =int(input())
print(n//3)

Submission status: Accepted

Solution code:
n=int(input())
from math import floor
print(floor(n/3))

Submission status: Accepted

Solution code:
a = int(input())

if a < 3:
  print(0)

else: 
  print(a // 3)

Submission status: Accepted

Solution code:
#A-Grouping 2(ABC089)
N=int(input())
print(N//3)

Submission status: Accepted

Solution code:

def main():


    N = int(input())

    print(int(N/3))
    


if __name__== "__main__":
    main()

Submission status: Accepted

Solution code:
N = int(input())
N1 = N // 3
print(N1)

Submission status: Accepted

Solution code:
x = int(input())
print(x // 3)

Submission status: Accepted

Solution code:
def main():
    N = int(input())

    print(N // 3)



main()

Submission status: Accepted

Solution code:
print (int(input())//3)

Submission status: Accepted

Solution code:

N = int(input())

N //= 3

print('%d' %(N))

Submission status: Accepted

Solution code:
a = int(input())
print( a // 3 )

Submission status: Accepted

Solution code:
#89

N = int(input())
print(N//3)

Submission status: Accepted

Solution code:
import math
n = int(input())
if n < 3:
  print(0)
else:
  print(math.floor(n/3))

Submission status: Accepted

Solution code:
N = int(input())
n = 0
while N >= 3:
  n += 1
  N -= 3

print(n)

Submission status: Accepted

Solution code:
a = int(input())
if a < 3:
    print(0)
else:
    print(a//3)

Submission status: Accepted

Solution code:
d=int(input())
print(d//3)

Submission status: Accepted

Solution code:
import math
N = int(input())
print(math.floor(N/3))

Submission status: Accepted

Solution code:
print(int(input())// 3)

Submission status: Accepted

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

n = int(input())
print(n//3)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import math

# NO, PAY-PAY
#import numpy as np
#import statistics
#from statistics import mean, median,variance,stdev
 
def main():
    N = int(input())
    ans = N//3
            
    print(ans)
	
if __name__ == "__main__":
	main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
N = int(input())
X = N % 3
print(int((N-X)/3))