Count the number of digits in a number recursively.

Name: InsidCode
Author: Namish Yadav

Difficulty: Medium

Phase: 3 · Recursion

XP Reward: 20 XP

Topics: Recursion, Medium

Supported Languages: Python, JavaScript, C, C++, Java

Problem Description

Given non-negative integer N, count its total number of digits recursively. Input Format: Read input from standard input (stdin). Output Format: Print the result to standard output (stdout).

Constraints

-10^9 <= N <= 10^9

Examples

Example 1

Input: 12345

Output: 5

Explanation: Sample execution for input 12345