class Solution:
    def arrangeCoins(self, n: int) -> int:
        
        count=1
        num_sum=0
        while num_sum<=n:
           
                num_sum+=count
                if num_sum<=n:
                    count+=1
                
        return (count-1)
                

edaa973ffeca4c69a4712fae7eeb1a6507f253f9
<mask token>

class Solution:
    <mask token>

class Solution:

    def arrangeCoins(self, n: int) ->int:
        count = 1
        num_sum = 0
        while num_sum <= n:
            num_sum += count
            if num_sum <= n:
                count += 1
        return count - 1

class Solution:
    def arrangeCoins(self, n: int) -> int:
        
        count=1
        num_sum=0
        while num_sum<=n:
           
                num_sum+=count
                if num_sum<=n:
                    count+=1
                
        return (count-1)
                
