// Arup Guha
// 3/6/2021
// Solution to 2020 SER Problem: Magic Trick

import java.util.*;

public class magic {

	public static void main(String[] args) {
	
		Scanner stdin = new Scanner(System.in);
		int[] freq = new int[26];
		char[] s = stdin.next().toCharArray();
		int res = 1;
		
		// Just count letter frequencies. If we get 2 for any letter, answer is no.
		for (int i=0; i<s.length; i++) {
			freq[s[i]-'a']++;
			if (freq[s[i]-'a'] > 1) {
				res = 0;
				break;
			}
		}
		
		// Ta da!
		System.out.println(res);
	}
}