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

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

print(n//3)

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):


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

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

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

Solution (Python):

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





 
def main():
    N = int(input())
    ans = N//3
            
    print(ans)
	
if __name__ == "__main__":
	main()

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

print(n//3)

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

print(n // 3)

Solution (Python):

N = int(input())
X = N % 3
print(int((N-X)/3))

Solution (Python):

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))

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

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

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

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

Solution (Python):

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))  
    solve(N)


if __name__ == '__main__':
    main()

Solution (Python):

import math

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

Solution (Python):

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')


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


def B():
    return


def C():
    return


def D():
    return


def E():
    return


def F():
    return


def G():
    return


def H():
    return


if __name__ == '__main__':
    A()

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):



N = int(input())



print(int(N / 3))

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

Solution (Python):



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

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

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

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

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

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

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

Solution (Python):



N = int(input())


print(int(N / 3))

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

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

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

Solution (Python):

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

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

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

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

print(result)

Solution (Python):

N = int(input())

print(N//3)

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

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

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

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

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

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

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

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

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

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

N = n()

print(N // 3)

Solution (Python):
import sys

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

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

    print(n // 3)

Solution (Python):
n=int(input())
if n==4 or n==5:
    print(1)
else:
    print(n//3)

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

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

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

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

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

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

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

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


if __name__ == '__main__':
	main()

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

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

print(n//3)

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

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

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

Solution (Python):
import math

n = int(input())

print(math.floor(n/3))

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

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

Solution (Python):
from functools import reduce
import math

def main():
    
    
    
    

    
    
    
    
    
    

    
    

    
    
    
    
    
    
    
    
    
    INF = float("inf")

    
    MOD = 10**9+7
    
    
    
    a = input().rstrip()
    
    
    
    
    
    
    
    
    
    
    

    
    
    
    
    
    print(int(a)//3)
    
if __name__ == '__main__':
    main()

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

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


abc()

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

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

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

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

Solution (Python):

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))  
    solve(N)

if __name__ == '__main__':
    main()

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

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

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

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

print(N // 3)

Solution (Python):


n = int(input())

print(n//3)

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

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

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

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

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

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

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

Solution (Python):
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)

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

print(N // 3)

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

print(N//3)

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

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

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

Solution (Python):
a = int(input())

print(a//3)

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

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

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

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

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

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

Solution (Python):

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))  
    solve(N)

if __name__ == '__main__':
    main()

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

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

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

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

print(n//3)

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

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

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

print(n//3)

Solution (Python):
a=int(input())

print(a//3)

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

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

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

Solution (Python):


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()

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

print(n//3)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):

N = int(input())

print(N // 3)

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

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

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

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

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

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

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

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

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

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

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

print(int(N//3))

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

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

Solution (Python):
import sys


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








a = int(input())

print(a//3)

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

print(cnt)

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

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

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

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

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

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

Solution (Python):
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()

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

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

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

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

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

Solution (Python):
import math

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

print(answer)

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

Solution (Python):
a=int(input())

print(a//3)

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

Solution (Python):

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


def submit():
    n = read_input()

    print(n // 3)

if __name__ == '__main__':
    submit()

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

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

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

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

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

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

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

print(int(n/3))

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):


n = int(input())

print(n // 3)

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

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

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

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

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

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

print(N // 3)

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

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

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

Solution (Python):
import math

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

Solution (Python):
import math

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

Solution (Python):
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)

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

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

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

Solution (Python):

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

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

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

print(n//3)

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

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

print(N//3)

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

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

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

Solution (Python):
import sys
input = sys.stdin.readline

n = int(input())

print(int(n/3))

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

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

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

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

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

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

print(int(N / 3))

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

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

Solution (Python):
a = int(input())

print(a//3)

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

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

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

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

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

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

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

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

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

print(N//3)

Solution (Python):


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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

print(N//3)

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

Solution (Python):
N =int(input())
A = N//3
print(A)

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

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

print(N//3)

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

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

Solution (Python):

N = int(input())

print(int(N/3))

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

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

print(n // 3)

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

ans = n // 3
print(ans)

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):


n = int(input())

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

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

print(N//3)

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

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

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

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

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

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

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

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

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

Solution (Python):

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

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

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

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

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

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

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

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


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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):

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

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


main()

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

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

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

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

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

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

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


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

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

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

print(n//3)

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

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

print(int(n/3))

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

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

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

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

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

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

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

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

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

N = N // 3
print(N)

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

Solution (Python):


import itertools
import collections
import bisect

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

if __name__ == '__main__':
    main()

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

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

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


if __name__ == "__main__":
    main()

Solution (Python):
import sys

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


if __name__ == '__main__':
    main()

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

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

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

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

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

Solution (Python):
n=int(input())
ans=0
j=0
for i in range(n):
    j+=1    
    if j==3:
        j=0
        ans+=1
print(ans)

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

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

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

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

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

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

Solution (Python):

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

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

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

A = N // 3
print(A)

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

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

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

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

Solution (Python):
from sys import stdin

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

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

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

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

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

ans = N // 3

print(ans)
print()

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

Solution (Python):

n = int(input())

print(n//3)

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

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

Solution (Python):
import sys

N = int(input())





print(int(N/3))

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

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

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

Solution (Python):
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)

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

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

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

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

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

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

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

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

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

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

Solution (Python):
int_n = int(input())

print(int_n // 3 )

Solution (Python):
N = int(input());print(N//3)

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

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

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

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

print(n // 3)

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

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

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

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

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

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

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

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

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

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

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

N = math.floor(N/3)

print(N)

Solution (Python):
a=int(input());print(a//3)

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

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

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

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

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

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

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

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

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

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

Solution (Python):


n = int(input())

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

Solution (Python):
""" AtCoder """

N = int(input())

print(N//3)

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

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

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

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

Solution (Python):

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

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

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

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

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

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

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

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

Solution (Python):


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

    print(int(N / 3))


if __name__ == '__main__':
    main()

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

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

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

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

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

print(N // 3)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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