Replace Question Marks

You are given a string s consisting of lowercase English letters and question marks ("?"). Your task is to replace every question mark with a lowercase English letter from the set \(\{a, b, c\}\) such that the resulting string does not contain any two consecutive identical characters.

It is guaranteed that an answer exists for the given input.

inputFormat

The input consists of a single line containing the string s (1 ≤ |s| ≤ 10⁵), where each character is either a lowercase English letter or a question mark ("?").

outputFormat

Output the resulting string after replacing every question mark such that no two adjacent characters are the same.

abc

abc