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:
# -*- coding: utf-8 -*-
N = int(input())

if N <=2:
    print(0)
elif N % 3 == 0:
    print(int(N/3))
elif N % 3 == 1:
    print(int((N-1)/3))
elif N % 3 == 2:
    print(int((N-2)/3))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys


def solve(N: int):
    print(N // 3)
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word

    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    solve(N)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#A
def A():
    n = II()
    print(n//3)
    return

#B
def B():
    return

#C
def C():
    return

#D
def D():
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == '__main__':
    A()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

N = int(input())

# print(N)

print(int(N / 3))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
#ABC89 A

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

Submission status: Accepted

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

# input
N = int(input())

# solve & output
print(int(N / 3))

Submission status: Accepted

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

Submission status: Accepted

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

for x in range(N):
  if (x+1)%3 == 0:
    result+=1

print(result)

Submission status: Accepted

Solution code:

N = int(input())

print(N//3)

Submission status: Accepted

Solution code:
nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(input())
s = lambda: input()

N = n()

print(N // 3)

Submission status: Accepted

Solution code:
import sys

def input():
    return sys.stdin.readline().rstrip()

if __name__ == "__main__":
    n = int(input())

    print(n // 3)

Submission status: Accepted

Solution code:
n=int(input())
if n==4 or n==5:
    print(1)
else:
    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:
import math

n = int(input())

print(math.floor(n/3))

Submission status: Accepted

Solution code:
from functools import reduce
import math

def main():
    # 文字列の2進数を数値にする
    # '101' → '5'
    # 文字列の頭に'0b'をつけてint()にわたす
    # binary = int('0b'+'101',0)

    # 2進数で立っているbitを数える
    # 101(0x5) → 2
    # cnt_bit = bin(5).count('1')
    
    # N! を求める
    # f = math.factorial(N)

    # N の逆元
    # N_inv = pow(N,MOD-2,MOD)

    # nCr
    # Nの階乗 * rの階乗の逆元 * n-rの階乗の逆元
    
    # 切り捨て
    # 4 // 3
    # 切り上げ
    #-(-4 // 3)
    
    # 初期値用:十分大きい数(100億)
    INF = float("inf")

    # 大きな素数
    MOD = 10**9+7
    
    # 1文字のみを読み込み
    # 入力:2
    a = input().rstrip()
    # 変数:a='2'
    
    # スペース区切りで標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a, b, c, d = (int(_) for _ in input().split())  
    # 変数:a=2 b=4 c=5 d =7
    
    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a = list(int(_) for _ in input().split())
    # 変数:a = [2, 4, 5, 7]    

    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2457
    # a = list(int(_) for _ in input())
    # 変数:a = [2, 4, 5, 7]    
    
    print(int(a)//3)
    
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def abc():
    n = int(input().rstrip())
    print(int(n / 3))


abc()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys


def solve(N: int):
    print(N//3)
    return


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    solve(N)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

n = int(input())

print(n//3)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = int(input())

print(a//3)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys


def solve(N: int):
    ret = N // 3
    print(ret)
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    solve(N)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n=int(input())

print(n//3)

Submission status: Accepted

Solution code:
a=int(input())

print(a//3)

Submission status: Accepted

Solution code:
###############################################################################

from sys import stdout
from bisect import bisect_left as binl
from copy import copy, deepcopy
from collections import defaultdict


mod = 1


def intin():
    input_tuple = input().split()
    if len(input_tuple) <= 1:
        return int(input_tuple[0])
    return tuple(map(int, input_tuple))


def intina():
    return [int(i) for i in input().split()]


def intinl(count):
    return [intin() for _ in range(count)]


def modadd(x, y):
    global mod
    return (x + y) % mod


def modmlt(x, y):
    global mod
    return (x * y) % mod


def lcm(x, y):
    while y != 0:
        z = x % y
        x = y
        y = z
    return x


def combination(x, y):
    assert(x >= y)

    if y > x // 2:
        y = x - y

    ret = 1

    for i in range(0, y):
        j = x - i
        i = i + 1

        ret = ret * j
        ret = ret // i

    return ret


def get_divisors(x):
    retlist = []
    for i in range(1, int(x**0.5) + 3):
        if x % i == 0:
            retlist.append(i)
            retlist.append(x // i)
    return retlist


def get_factors(x):
    retlist = []
    for i in range(2, int(x**0.5) + 3):
        while x % i == 0:
            retlist.append(i)
            x = x // i
    retlist.append(x)
    return retlist


def make_linklist(xylist):
    linklist = {}
    for a, b in xylist:
        linklist.setdefault(a, [])
        linklist.setdefault(b, [])
        linklist[a].append(b)
        linklist[b].append(a)
    return linklist


def calc_longest_distance(linklist, v=1):
    distance_list = {}
    distance_count = 0
    distance = 0
    vlist_previous = []
    vlist = [v]
    nodecount = len(linklist)

    while distance_count < nodecount:
        vlist_next = []
        for v in vlist:
            distance_list[v] = distance
            distance_count += 1
            vlist_next.extend(linklist[v])
        distance += 1
        vlist_to_del = vlist_previous
        vlist_previous = vlist
        vlist = list(set(vlist_next) - set(vlist_to_del))

    max_distance = -1
    max_v = None
    for v, distance in distance_list.items():
        if distance > max_distance:
            max_distance = distance
            max_v = v

    return (max_distance, max_v)


def calc_tree_diameter(linklist, v=1):
    _, u = calc_longest_distance(linklist, v)
    distance, _ = calc_longest_distance(linklist, u)
    return distance


class UnionFind:

    def __init__(self, n):
        self.parent = [i for i in range(n)]

    def root(self, i):
        if self.parent[i] == i:
            return i
        self.parent[i] = self.root(self.parent[i])
        return self.parent[i]

    def unite(self, i, j):
        rooti = self.root(i)
        rootj = self.root(j)
        if rooti == rootj:
            return
        if rooti < rootj:
            self.parent[rootj] = rooti
        else:
            self.parent[rooti] = rootj

    def same(self, i, j):
        return self.root(i) == self.root(j)


###############################################################################


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

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:
N = int(input())
print((N-(N%3))//3)

Submission status: Accepted

Solution code:
N = int(input())

print(int(N//3))

Submission status: Accepted

Solution code:
import sys


def input():
    return sys.stdin.readline()[:-1]

# N = int(input())
# A = [int(x) for x in input().split()]
# a, b, c = map(int, input().split())
# name1 = str(input())
# alph = {"A": 1, "B": 2, "C": 3, "D": 4, "E": 5}


a = int(input())

print(a//3)

Submission status: Accepted

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

print(cnt)

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())
if N<3:
  print(0)
else:
  print(N//3)

Submission status: Accepted

Solution code:
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

def solve():
    n = f()[0]
    print(n//3)

solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

print(answer)

Submission status: Accepted

Solution code:

def read_input():
    n = int(input())
    return n


def submit():
    n = read_input()

    print(n // 3)

if __name__ == '__main__':
    submit()

Submission status: Accepted

Solution code:
N = int(input())

groups = int(N/3)
if N/3 > 2:
  print(groups)
else:
  print(0)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

Solution code:
import functools

import os

INF = float('inf')


def inp():
    return int(input())


def inpf():
    return float(input())


def inps():
    return input()


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


def inlf():
    return list(map(float, input().split()))


def inls():
    return input().split()


def debug(fn):
    if not os.getenv('LOCAL'):
        return fn

    @functools.wraps(fn)
    def wrapper(*args, **kwargs):
        print('DEBUG: {}({}) -> '.format(
            fn.__name__,
            ', '.join(
                list(map(str, args)) +
                ['{}={}'.format(k, str(v)) for k, v in kwargs.items()]
            )
        ), end='')
        ret = fn(*args, **kwargs)
        print(ret)
        return ret

    return wrapper

n = inp()
print(n//3)

Submission status: Accepted

Solution code:
# ABC089A - Grouping 2
print(int(input()) // 3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

n = int(input())

print(int(n/3))

Submission status: Accepted

Solution code:
N=int(input())

cnt=0
while N >= 3:
    cnt += 1
    N = N-3
print(cnt)

Submission status: Accepted

Solution code:
#089

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
import math
print(math.floor(n/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())

print(int(N/3))

Submission status: Accepted

Solution code:
n = int(input())

ans = n // 3
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

n = int(input())

print(n//3+int((n%3)/4))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def solve(string):
    return str(int(string) // 3)


if __name__ == '__main__':
    print(solve(input()))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


main()

Submission status: Accepted

Solution code:
def grouping_2(N: int)->int:
    return N // 3


if __name__ == "__main__":
    N = int(input())
    ans = grouping_2(N)
    print(ans)

Submission status: Accepted

Solution code:
n = int(input())

print(int(n/3))

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
N = int(input())

N = N // 3
print(N)

Submission status: Accepted

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

import itertools
import collections
import bisect

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys

def main():
    input = sys.stdin.readline
    N = int(input())
    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())
ans=0
j=0
for i in range(n):
    j+=1    
    if j==3:
        j=0
        ans+=1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc089/tasks/abc089_a
n = int(input())
print(n // 3)

Submission status: Accepted

Solution code:
N = int(input())

A = N // 3
print(A)

Submission status: Accepted

Solution code:
from sys import stdin

a = int(stdin.readline().rstrip())
print(a//3)

Submission status: Accepted

Solution code:
N = int(input())

ans = N // 3

print(ans)
print()

Submission status: Accepted

Solution code:

n = int(input())

print(n//3)

Submission status: Accepted

Solution code:
import sys
# A,B,C = [int(n) for n in input().split()]
N = int(input())
# A = [0]*N
# for i in range(N):
#     A[i] = int(input())
# S = str(input())
# T = str(input())
print(int(N/3))

Submission status: Accepted

Solution code:
import bisect
import numpy as np
import sys
input = sys.stdin.readline
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

N = I()

print(N//3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
int_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())
if (n < 2):
    print(0)
else:
    print(n//3)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

N = math.floor(N/3)

print(N)

Submission status: Accepted

Solution code:
a=int(input());print(a//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:
#encoding:utf-8

n = int(input())

if n == 0:
    print("0")
    exit()
else:
    print(n//3)

Submission status: Accepted

Solution code:
""" AtCoder """

N = int(input())

print(N//3)

Submission status: Accepted

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

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

    print(int(N / 3))


if __name__ == '__main__':
    main()

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())
ans = n // 3
print(ans)

Submission status: Accepted

Solution code:
n=int(input())
if n%3==0:
    print(n//3)
else:
    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:
# -*- coding: utf-8 -*-
N = int(input())
if N <= 2:
  print(0)
else:
  print(int(N // 3))

Submission status: Accepted

Solution code:
n=int(input())

if n>=3:
    print(n//3)
else:
    print(0)

Submission status: Accepted

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


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

group3 = N//3

print(group3)

Submission status: Accepted

Solution code:
N=int(input())

print(int(N/3))

Submission status: Accepted

Solution code:
print input()/3

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

print(int(N//3))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

ans = N // 3
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
N = int(input())
print(N//3)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
a  = int( input())

print(a//3)

Submission status: Accepted

Solution code:
n = int(input())

if n == 1 and n == 2:
    print(0)
elif n == 4 and n == 5:
    print(1)
else:
    print(n//3)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

M = N//3

print(M)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

ans = int(N / 3)

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:
N = int(raw_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:
N = int(input())
x = int(N/3)
print(x)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/python3

from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def main():
    N = int(input())
    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(int(N/3))

Submission status: Accepted

Solution code:
x=int(input())
#print(x)

print(x//3)

Submission status: Accepted

Solution code:
N = int(input())

x = 0

if N > 2:
  x = N//3
  
print(x)

Submission status: Accepted

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

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

    print(n//3)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# cook your dish here
a=int(input())

print(a//3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

print(int(N // 3))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
if N >= 3:
  print((N-3)//3 + 1)
else:
  print(0)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

if N < 3:
    print(0)
else:
    print(N//3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ６月５日
a = int(input())
b = a%3
c = a//3
if a >= 3:
    print(c)
else:
    print(int(0))

Submission status: Accepted

Solution code:
# ６月５日
a = int(input())
b = a%3
c = a//3
if a > 3:
    print(c)
else:
    print(int(0))

Submission status: Accepted

Solution code:
print('{}'.format(int(input())//3))

Submission status: Accepted

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

N = int(input())

print(int(N / 3))

Submission status: Accepted

Solution code:
import math


N = int(input())
N = math.ceil(N)

print(math.floor(N/3))

Submission status: Accepted

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

while( num >= 3 ):
    num -= 3
    group += 1

print( group )

Submission status: Accepted

Solution code:
while True:
    N = int(input())
    if N >= 1 and N <= 1000:
        break
if N < 3:
    print(0)
if N >= 3:
    print(int(N/3))

Submission status: Accepted

Solution code:
#!C:\Users\daichi\Anaconda3/python.exe
# -*- coding: utf-8 -*-

N = int(input())
i=0

for i in range(N):
    N = N - 3
    if(N<0):
        break
print(i)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print("%d" % (int(input()) / 3))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# your code goes here
N = int(input())

print(N//3)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
num = int(input())
saidaisuu = int(num/3)
print(saidaisuu)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
import collections
import itertools
import array
import inspect

# Set max recursion limit
sys.setrecursionlimit(10000)

# Debug output
def chkprint(*args):
    names = {id(v):k for k,v in inspect.currentframe().f_back.f_locals.items()}
    print(', '.join(names.get(id(arg),'???')+' = '+repr(arg) for arg in args))

# Binary converter
def to_bin(x):
    return bin(x)[2:]

# --------------------------------------------

dp = None

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

main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

print(str(N//3))

Submission status: Accepted

Solution code:
#coding: UTF-8

n = int(input())

print(n // 3)

Submission status: Accepted

Solution code:
import re
import sys

if __name__ == '__main__':
    N = input()
    a = N / 3
    print a

Submission status: Accepted

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

Submission status: Accepted

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


if x < 3:
    print(0)
else:
    print(y)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
ans = 0
if n > 2:
    for i in range(3, n + 1):
        k = n // i
        if ans < k:
            ans = k
print(ans)

Submission status: Accepted

Solution code:
#__author__ = "tatuo"
#__date__ = "$Mar 3, 2018 12:34:20 PM$"

import math
import re
import sys


def getinputdata():

    # 配列初期化
    array_result = []
    
    data = input()

    
    array_result.append(data.split(" "))

    flg = 1

    try:


        while flg:

            data = input()

            array_temp = []

            if(data != ""):
                
                array_result.append(data.split(" "))

                flg = 1

            else:

                flg = 0
    finally:


        return array_result




arr_data = getinputdata()

n=int(arr_data[0][0])


print(n//3)

Submission status: Accepted

Solution code:
N=int(input())

num=int(N/3)

print(num)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


N = int(input())

print(N//3)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

if n < 3:
  print(0)
else:
  print(n // 3)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
if N % 3 == 2:
    x = (N - 2) // 3
elif N % 3 == 1:
    x = (N - 1) // 3
else:
    x = N // 3
 
print(x)

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    N = int(input())
    print(N // 3)

Submission status: Accepted

Solution code:
#coding=utf-8

def solve(n):
    return int(n / 3)

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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



print(N)

quit()

Submission status: Accepted

Solution code:
a = int(input())
print("{}".format(a//3))