You are given a number ’n’.Find the number of digits of ‘n’ that evenly divide ‘n’.

Sure, here is a step-by-step guide to solve this problem:

1. Convert the number 'n' to a string to easily access each digit.

2. Initialize a counter to zero. This will keep track of the number of digits that evenly divide 'n'.

3. Loop through each digit in the string representation of 'n'.

4. For each digit, convert it back to an integer.

5. Check if the digit is not zero (to avoid division by zero error) and if 'n' is divisible by the digit. If both conditions are true, increment the counter by one.

6. Continue this process until all digits have been checked.

7. The counter now represents the number of digits of 'n' that evenly divide 'n'.

Here is a Python code snippet that implements the above steps:

def find_divisible_digits(n):
    n_str = str(n)
    counter = 0
    for digit in n_str:
        digit = int(digit)
        if digit != 0 and n % digit == 0:
            counter += 1
    return counter

You can call this function with the number 'n' as the argument to get the number of digits that evenly divide 'n'. For example, find_divisible_digits(123456) will return 2 because only the digits 1 and 3 evenly divide 123456.