class Solution {
public:
    int findNthDigit(int n) {
        int digit = 1;
        long start = 1;
        long count = 9;
        while(n > count)
        {
            n -= count;
            start *= 10;
            digit++;
            count = start * digit * 9;
        }

        long num = start + (n-1) / digit;
        string s = to_string(num);
        return s[(n-1) % digit] - '0';
    }
};