
    Given the current number of content items being processed by the moderation system, determine the smallest perfect square batch size that can accommodate all items while maintaining optimal grid-based scanning efficiency. For example, if the system is currently processing 30 items, the function should return 36 (6²) as the next suitable batch size for the content moderation grid.
    

    
import math

def next_Perfect_Square(N):
    """
    Given the current number of content items being processed by the moderation system, determine the smallest perfect square batch size that can accommodate all items while maintaining optimal grid-based scanning efficiency. For example, if the system is currently processing 30 items, the function should return 36 (6²) as the next suitable batch size for the content moderation grid.
    

    """
import math

def next_Perfect_Square(N):
    """
    Given the current number of content items being processed by the moderation system, determine the smallest perfect square batch size that can accommodate all items while maintaining optimal grid-based scanning efficiency. For example, if the system is currently processing 30 items, the function should return 36 (6²) as the next suitable batch size for the content moderation grid.
    

    """
    nextN = math.floor(math.sqrt(N)) + 1
    return nextN * nextN