Minimum Steps Required

Problem Statement

Minimum Steps Required Problem Description You visited your friend's home which is located at position 0. Now you want to go back home but with some constraints, you can go either 2 or 3 steps either to the right or to the left. Your task is to find the minimum number of steps required to reach your home back which is located at position N. Input Format: The input consists of a single line: The first line contains an Integer N, the location of your home. The input will be read from the STDIN by the candidate. Output Format: Print the minimum number of steps to reach home. The output will be matched to the candidate's output printed on the STDOUT. Constraints 1 ≤ N ≤ 10 9 Examples Example 1: Input: N = 1 Output: 2 Explanation: One of the ways is to follow the following way: First, go to the right by 3 points then go to the left by 2 points. 0 -> 3 -> 1 Example 2: Input: N = 3 Output: 1 Explanation: To reach position 3 from 0, you can take one step to the right by 3 points: 0 -> 3