SoftUni Parking - Associative Arrays

import java.util.LinkedHashMap;
import java.util.Map;
import java.util.Scanner;

public class SoftUniParking {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        int n = Integer.parseInt(scanner.nextLine());

        Map<String, String> parkingUsers = new LinkedHashMap<>();

        for (int i = 0; i < n; i++) {
            String[] data = scanner.nextLine().split(" ");
            String command = data[0];
            String userName = data[1];

            switch (command) {
                case "register":
                    String licensePlate = data[2];

                    if (!parkingUsers.containsKey(userName)) {
                        parkingUsers.put(userName, licensePlate);
                        System.out.println(userName + " registered " + licensePlate + " successfully");
                    } else {
                        System.out.println("ERROR: already registered with plate number " + licensePlate);
                    }
                    break;
                case "unregister":
                    if (!parkingUsers.containsKey(userName)) {
                        System.out.println("ERROR: user " + userName + " not found");
                    } else {
                        parkingUsers.remove(userName);
                        System.out.println(userName + " unregistered successfully");
                    }
                    break;
            }
        }
        for (Map.Entry<String, String> entry : parkingUsers.entrySet()) {
            System.out.println(entry.getKey() + " => " + entry.getValue());
        }
    }
}