human
Write me a code to finding n and the other steps required given the following:
Finding n | Python3 program to find n - th number with prime digits 2 , 3 and 7.
remainder for check element position.
if number is 1 st position in tree.
if number is 2 nd position in tree.
if number is 3 rd position in tree.
if number is 4 th position in tree.
Driver code"
How can the above be solved in Python?
assistant
#Here is code to finding n and the other steps required.
 def nthprimedigitsnumber ( number ) :
	num = " " ;
	while ( number > 0 ) :
		rem = number % 4 ;
		if ( rem == 1 ) :
			num += '2' ;
		if ( rem == 2 ) :
			num += '3' ;
		if ( rem == 3 ) :
			num += '5' ;
		if ( rem == 0 ) :
			num += '7' ;
		if ( number % 4 == 0 ) :
			number = number - 1
		number = number // 4 ;
	return num [ : : - 1 ] ;
number = 21 ;
print ( nthprimedigitsnumber ( 10 ) ) ;
print ( nthprimedigitsnumber ( number ) ) ;