Find product of digits of 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 positive integer N, compute the product of its 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: 234

Output: 24

Explanation: Sample execution for input 234