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

Solution (Python):
n=int(input())
if n<3: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):
a = int(input())

print(a // 3)

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

print(n//3)

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

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

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

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

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

Solution (Python):
n = input()
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):
print(int(input())//3)

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

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

x = number // 3

print(x)

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

Solution (Python):
import sys
sys.setrecursionlimit(10**9)

def mi(): return map(int,input().split())
def ii(): return int(input())
def isp(): return input().split()
def deb(text): print("-------\n{}\n-------".format(text))

INF=10**20
def main():
    N=ii()

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






if __name__ == "__main__":
    main()

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

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


if __name__ == "__main__":
    main()

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

ans = n//3
print(ans)

Solution (Python):


N = int(input())

if N < 1 or 1000 < N:
    print('数値が範囲外です')
elif N < 3:
    print(0)
else:
    print(N // 3)

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

print(N // 3)

Solution (Python):
import math

N = int(input())

answer = math.floor(N/3)


if answer >= 1:
    print(answer)
else:
    print(0)

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

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

x = N // 3

print(x)

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

Solution (Python):

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

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

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):
N = int( input())

x = N // 3
 
print(x)

Solution (Python):






input_num = int(input())


result = int(input_num / 3)
print(result)

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

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

print(student_N // 3)

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

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

answer = x // 3
print (answer)

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

print(N//3)

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

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

x = N // 3

print(x)

Solution (Python):



x=input()
seito=int(x)


sum= seito//3
print(sum)

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

Solution (Python):


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

Solution (Python):







N = int(input())


x = int(N // 3)

print(x)

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

answer = x // 3
print (answer)

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

print(n // 3)

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

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

x = print(N // 3)

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

Solution (Python):
N = int(input())
import math
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):

N=input()

if int(N) >= 3:
    num = int(N)/3
    print(int(num))

else:
    print('0')

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

x = N // 3

print(x)

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


x = N // 3
print(x)

Solution (Python):


N = int (input())

x = N // 3

print(x)

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

print(int(N / 3))

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

x = N // 3
print(x)

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

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

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

Solution (Python):

N = int( input() )





x = int( N / 3 )

print( x )

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

x = N // 3
print(x)

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

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

1 < N and N < 1000

print(N//3)

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

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

Solution (Python):



N = int(input())

result = int(N/3)

print(result)

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

Solution (Python):
n=input()


print(int(n)//3)

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

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

print(N // 3)

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

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

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

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

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

print(N // 3)

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

x = n // 3

print(x)

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

num2 = num % 3

if num < 3:
    print('0')
elif num2 < 0:
    print(num // 3 + 1)
else:
    print(num // 3)

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

print(n//3)

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

x = N // 3
print(x)

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

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

x=N//3

print(x)

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

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

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

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

Solution (Python):




N = int(input())

x = N // 3
print(x)

Solution (Python):





student = int(input())

print(student // 3)

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

Solution (Python):


N = int(input())


if N % 3 == 0:
    answer = N // 3
    print(answer)
else:
    answer = N // 3
    print(answer)

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

print(int(N/3))

Solution (Python):

N = int(input())
if 1 <= N & N <= 1000:
    result = int(N/3)
    print(result)

Solution (Python):

x = int(input())


ansewr = x // 3
print(ansewr)

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

x = N // 3

if x >= 1:
    print(x)

else:
    print('0')

Solution (Python):

N = int(input())


answer = N // 3


print(answer)

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

Solution (Python):
S = input()
          
q = int(S) // 3
print(q)

Solution (Python):



n = int(input())


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

Solution (Python):




N = int(input())


x = N // 3
print(x)

Solution (Python):

N = int(input())


Surplus =  int( N ) % 3


if Surplus < 3:
    print( N //3 )

Solution (Python):
import math as m

N=input()
N=int(N)
n=N//3
n=m.floor(n)
print(n)

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

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(int(a/3))

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

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

Solution (Python):






input_num = int(input())


result = int(input_num / 3)
print(result)

Solution (Python):

n = int(input())

print(n // 3)

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

if x >= 1:
    print(x)
else:
    print('0')

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

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

x = N // 3
print(x)

Solution (Python):


N = int(input()) 

group_N = N // 3    

print(group_N)

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

x = N // 3
print(x)

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

print(N//3)

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

Solution (Python):







N = int(input(''))


answer=int(N/3)


print(answer)

Solution (Python):
def resolve():
    n = int(input())
    c = 0
    while n - 3 >= 0:
        n -= 3
        c += 1
    print(c)
resolve()

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

answer = n // 3

print(answer)

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

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

Solution (Python):

n=int(input())


print(n//3)

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

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

x=N//3              
                    
print(x)

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

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

x = N // 3

print(x)

Solution (Python):






N = int(input())




answer = int(N / 3)



print(answer)

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

print(number // 3)

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

Solution (Python):






N = int(input())




if N % 3 == 0:
    
    answer = int(N / 3)
elif N % 3 == 1:
    
    answer = int((N - 1) / 3)
else:
    
    answer = int((N - 2) / 3)


print(answer)

Solution (Python):


N = int(input())

x = N // 3

print(x)

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

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

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

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

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

if total_students >= 3:
    groups_of_three_student = total_students // 3
    print(groups_of_three_student)
else:
    print(0)

Solution (Python):

N = int(input(''))


Group = N // 3


print(Group)

Solution (Python):

a = int(input())


answer = a // 3


print(answer)

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

Solution (Python):








N=int(input())



x=N//3
print(x)

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

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

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

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

Solution (Python):
import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()

def resolve():
    N = I()

    ans = N // 3
    print(ans)

if __name__ == '__main__':
    resolve()

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

Solution (Python):
n = int (input ())
m = n%3
o = n-m
p = round (o/3)
print (p)

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

Solution (Python):









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

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

print(n//3)

Solution (Python):
N =int(input())
if N<=2:
    print(0)
    exit()

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

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

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


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


if __name__ == '__main__':
    main()

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


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

    print(N // 3)

    return


if __name__ == '__main__':
    main()

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):
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):
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(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(raw_input())/3

Solution (Python):

















import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
import numpy as np
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()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

print(INT() // 3)

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

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(str(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):
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(n//3)

Solution (Python):
x = int(input())
print(x//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(n//3)

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


if __name__ == "__main__":
    solve()

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

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

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

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

Solution (Python):





import math
import fractions
import sys
import bisect
import heapq  
import collections
from collections import Counter
from collections import deque
import pprint
import itertools

sr = lambda: input()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

"""nを素因数分解"""
"""2以上の整数n => [[素因数, 指数], ...]の2次元リスト"""


def factorization(n):
    arr = []
    temp = n
    if n == 1:
        return arr

    for i in range(2, int(-(-n ** 0.5 // 1)) + 1):
        if temp % i == 0:
            cnt = 0
            while temp % i == 0:
                cnt += 1
                temp //= i
            arr.append([i, cnt])

    if temp != 1:
        arr.append([temp, 1])

    if arr == []:
        arr.append([n, 1])

    return arr



def power(a, n, mod):
    x = 1
    while n:
        if n & 1:
            x *= a % mod
        n >>= 1
        a *= a % mod
    return x % mod



def kaijo(n, l, mod):
    if n == 0:
        return 1
    a = n
    tmp = n - 1
    while (tmp >= l):
        a = a * tmp % mod
        tmp -= 1
    return a


class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())


def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)

    divisors.sort()
    return divisors


inf = 10 ** 18
mod = 10 ** 9 + 7

n = ir()
print(n//3)

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

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

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

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

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

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

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

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

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

Solution (Python):
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def s(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
cnt = 0
ans = 0
inf = float("inf")

n = k()
print(n//3)

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

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

Solution (Python):
import sys
from math import ceil
def input(): return sys.stdin.readline().strip()


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

if __name__ == "__main__":
    main()

Solution (Python):
def INT():
    return int(input())

def MI():
    return map(int, input().split())

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

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

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

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

Solution (Python):
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

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

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

print(int(a/3))

Solution (Python):
import sys
import math
N = int(input())
if not (1 <= N <= 1000):
    sys.exit()

print(math.floor(N/3))

Solution (Python):
s = input()
N = int(s)
print(int(N/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):
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(n//3)

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

print(N//3)

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

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

count = int(0)
g = N

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

print(count)

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


print(N//3)

Solution (Python):
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
INF = 10**9
mod = 10**9+7

N = i()
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):


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

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

a = N // 3
print(a)

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

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

ans = N // 3

print(ans)

Solution (Python):
def main():
    from builtins import int, map, list, print
    import sys
    sys.setrecursionlimit(10 ** 6)

    input = (lambda: (sys.stdin.readline()).rstrip())
    input_list = (lambda: input().split())
    input_number = (lambda: int(input()))
    input_number_list = (lambda: list(map(int, input_list())))

    N = input_number()
    print(N // 3)


if __name__ == '__main__':
    main()

Solution (Python):
a = int(input())
if a<=2:
  print(0)
else:
  print(a//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):
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

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):
import sys
readline = sys.stdin.readline

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

Solution (Python):

N = int(input())

print(N // 3)

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

Solution (Python):
import sys
input=sys.stdin.readline
sys.setrecursionlimit(10**6)

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

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

    print(N // 3)

if __name__ == '__main__':
    main()

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

print(int(n//3))

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

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

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

Solution (Python):
def actual(n):
    return int(n // 3)

n = int(input())
print(actual(n))

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

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

print(n // 3)

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

print(c)

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

print((n - n%3)//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(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):
def main():
    n = int(input())
    res = n // 3
    print(res)

if __name__ == '__main__':
    main()

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

Solution (Python):
n = int(input())
if n < 3:
    print(0)
else:
    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):
N_str = input()
N = int(N_str)

Gr_num = 3 

N_div = N // Gr_num

if N >= 3:
    print(N_div)
elif N < 3:
    print(0)

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

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

Solution (Python):
n=int(input())
num=0
while n>=3:
    n-=3
    num+=1
print(num)

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)