leetcode 172. Factorial Trailing Zeroes

class Solution {
public:
    int trailingZeroes(int n) {
        int ans1=0;
        while(n > 0){
            ans1 += n/5;
            n/=5;
        }
        return ans1;
    }
};