from collections import Counter
import heapq

def rearange_string(S):
    n = len(S)
    if n <= 1:
        return True

    counts = Counter(S)
    if max(counts.values()) > (n + 1) // 2:
        return False

    heap = [(-cnt, ch) for ch, cnt in counts.items()]
    heapq.heapify(heap)

    prev_count, prev_char = 0, ''
    result_len = 0

    while heap:
        count, ch = heapq.heappop(heap)
        result_len += 1
        count += 1

        if prev_count < 0:
            heapq.heappush(heap, (prev_count, prev_char))

        prev_count, prev_char = count, ch

    return result_len == n