Code
#include<bits/stdc++.h>
using namespace std;

// Function to calculate the factorial of a number using recursion
int factorial(int num) {
    // Base case: factorial of 0 is 1
    if (num == 0) {
        return 1;
    }
    // Recursive case: num * factorial(num - 1)
    return num * factorial(num - 1);
}

int main() {
    int n = 10;  // Example number to calculate the factorial
    int fact = factorial(n);  // Calculate the factorial of n
    
    int cnt = 0;
    // Count the number of trailing zeros in the factorial
    while (fact % 10 == 0) {
        cnt++;  // Increment count for each trailing zero
        fact /= 10;  // Remove the trailing zero by dividing by 10
    }

    // Output the number of trailing zeros
    cout << "The trailing zeros are: " << cnt << endl;

    return 0;
}
// Solution class to calculate factorial and count trailing zeros
class Solution {

    // Function to calculate the factorial of a number usi