// 
// Decompiled by Procyon v0.5.36
// 

public class Challenge
{
    public static String f1(final String s) {
        final StringBuilder b = new StringBuilder();
        final char[] arr = s.toCharArray();
        for (int i = 0; i < arr.length; ++i) {
            b.append((char)(arr[i] + i));
        }
        return b.toString();
    }
    
    public static String f1_rev(final String s) {
        final StringBuilder b = new StringBuilder();
        final char[] arr = s.toCharArray();
        for (int i = 0; i < arr.length; ++i) {
            b.append((char)(arr[i] - i));
        }
        return b.toString();
    }
    
    public static String f2(final String s) {
        final int half = s.length() / 2;
        return String.valueOf(s.substring(half + 1)) + s.substring(0, half + 1);
    }
    
    public static String f3() {
        return f1(f2("$aQ\"cNP `_\u001d[eULB@PA'thpj]"));
    }
    
    public static void main(final String[] args) {
        System.out.println("You really thought finding the flag would be so easy?");
    }
}

    public static void main(final String[] args) {
        System.out.println(f3());
    }