asdfngmh

package ExerciseStacksAndQueues;

import java.util.ArrayDeque;
import java.util.Scanner;

public class SimpleTextEditor {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        ArrayDeque<Integer> stack = new ArrayDeque<>();

        int n = Integer.parseInt(scanner.nextLine());
        StringBuilder currentText = new StringBuilder();

        for (int count = 1; count <= n ; count++) {
            String command = scanner.nextLine();
            String commandNumber = (command.split("\\s+")[0]);
            switch (commandNumber){
                case"1":
                    String textToAdd = command.split("\\s+")[1];
                    currentText.append(textToAdd);
                    break;
                case"2":
                    int countElements = Integer.parseInt(command.split("\\s+")[1]);
                    int startIndex = currentText.length() - countElements;
                    String textToRemove = currentText.substring(startIndex);
                    currentText = currentText.delete(startIndex, startIndex + countElements);
                    break;
                case"3":
                    int index = Integer.parseInt(command.split("\\s+")[1]);
                    System.out.println(currentText.charAt(index-1));
                    break;
                case"4":
                    break;
            }

        }
    }
}