import java.io.IOException;
import java.io.InputStream;
import java.util.ArrayDeque;
import java.util.NoSuchElementException;
import java.util.Queue;

class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;

    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        } else {
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }

    private int readByte() {
        if (hasNextByte())
            return buffer[ptr++];
        else
            return -1;
    }

    private static boolean isPrintableChar(int c) {
        return 33 <= c && c <= 126;
    }

    public boolean hasNext() {
        while (hasNextByte() && !isPrintableChar(buffer[ptr]))
            ptr++;
        return hasNextByte();
    }

    public String next() {
        if (!hasNext())
            throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while (isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }

    public long nextLong() {
        if (!hasNext())
            throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while (true) {
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            } else if (b == -1 || !isPrintableChar(b)) {
                return minus ? -n : n;
            } else {
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }

    public int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)
            throw new NumberFormatException();
        return (int) nl;
    }

    public double nextDouble() {
        return Double.parseDouble(next());
    }
}

public class Main {
    static int MOD = 1000000007;

    

    public static class Mas {
        int x;
        int y;
        int step;

        Mas(int x, int y, int step) {
            this.x = x;
            this.y = y;
            this.step = step;
        }
    }

    private static final int[] vX = { 1, 0, 0, -1 };
    private static final int[] vY = { 0, 1, -1, 0 };
    static Queue<Mas> queue;
    static boolean[][] seen;

    static Mas BFS(int si, int sj, char goal, int n, char[][] a) {
        int w = a[0].length;
        int h = a.length;
        queue = new ArrayDeque<>();
    
        queue.add(new Mas(si, sj, 0));
        seen = new boolean[h + 3][w + 3];
        Mas mas = null;
        while (!queue.isEmpty()) {
            mas = queue.poll();
            if (seen[mas.x][mas.y]) {
                continue;
            }
            seen[mas.x][mas.y] = true;
            if (mas != null) {
                if (a[mas.x][mas.y] == goal) {
                    return mas;
                }
                for (int i = 0; i < 4; i++) {
                    int wkx = mas.x + vX[i];
                    int wky = mas.y + vY[i];
                    int step = mas.step + 1;
                    if (wkx >= 0 && wkx < h && wky >= 0 && wky < w && a[wkx][wky] != 'X') {
                        Mas nMas = new Mas(wkx, wky, step);
                        queue.add(nMas);
                    }
                }
            }
        }
        return null;
    }

    public static void main(String[] args) {

        FastScanner fs = new FastScanner();
        int n = fs.nextInt();
        System.out.println("ABC" + n);
    }

}


Measured memory_bytes: 21332