human
Maximum count of elements divisible on the left for any element | Function to return the maximum count of required elements.
divisible [ i ] will store true if arr [ i ] is divisible by any element on its right.
To store the maximum required count.
For every element of the array.
If the current element is divisible by any element on its right.
Find the count of element on the left which are divisible by the current element.
If arr [ j ] is divisible then set divisible [ j ] to true.
Update the maximum required count.
Driver code"
Solution in Python:

=====
Give me a code to maximum count of elements divisible on the left for any element and the other steps required?
assistant
#Here is code to maximum count of elements divisible on the left for any element and the other steps required.
 def findMax ( arr , n ) :
	divisible = [ False ] * n ;
	res = 0 ;
	for i in range ( n - 1 , - 1 , - 1 ) :
		if ( divisible [ i ] ) :
			continue ;
		cnt = 0 ;
		for j in range ( i ) :
			if ( ( arr [ j ] % arr [ i ] ) == 0 ) :
				divisible [ j ] = True ;
				cnt += 1 ;
		res = max ( res , cnt ) ;
	return res ;
if __name__ == " _ _ main _ _ " :
	arr = [ 8 , 1 , 28 , 4 , 2 , 6 , 7 ] ;
	n = len ( arr ) ;
	print ( findMax ( arr , n ) ) ;