Team Formation Challenge

You are given an integer n representing the number of employees available in a company. Your task is to form teams such that each team consists of exactly 3 employees. The goal is to determine the maximum number of teams that can be formed. Note that the extra employees who cannot form a complete team are not used.

Mathematical Formulation:

Given an integer \( n \), the answer is \( \lfloor \frac{n}{3} \rfloor \).

This problem is a straightforward application of integer division, where the division operation automatically discards any fractional part.

inputFormat

The input consists of a single integer n (\(0 \leq n \leq 10^9\)), which represents the number of employees. The input is given via standard input.

outputFormat

Output a single integer representing the maximum number of teams that can be formed, with each team consisting exactly of 3 employees. The output should be printed via standard output.

14

4