The Solution of UESTC 2016 Summer Training #1 Div.2 Problem A

Link

http://acm.hust.edu.cn/vjudge/contest/121539#problem/A

Description

standard input/output

Haneen is trying to solve an easy problem given by Dr. Ibrahim in the Algorithms course. The problem is to find the lexicographically smallest Longest Common Subsequence (LCS) between two strings. Unfortunately, she got many runtime errors. After tens of wrong submissions, she asked Master Hazem about the problem and he replied:

"C strings are terminated with the null character ‘\0’. When you want to store a string of length N, the size of the array should be at leastN + 1."

Haneen didn’t get anything of what he said, and now, she is in need of your help! Given the length of the string Haneen has, determine the minimum size of an array needed to store this string.

Input

The input contains a single integer N(1 ≤ N ≤ 10⁵), the length of the string.

Output

Print the minimum size of an array needed to store the string.

Sample Input

Input

3

Output

4

Input

7

Output

8

Input

64

Output

65

Solution

This is an easy question.The description of the problem has told us C strings usually prepare an extra space for the null character '\0'.So,just input an integer n,then output n+1.

C++ Code

#include<iostream>
using namespace std;
int main()
{
　　int n;
　　cin>>n;
　　cout<<n+1<<endl;
　　return 0;
}