#include #define rep(i,n) for(int i = 0; i < (n); ++i) #define srep(i,s,t) for (int i = s; i < t; ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) using namespace std; typedef long long int ll; typedef pair P; #define yn {puts("YES");}else{puts("NO");} #define MAX_N 200005 int main() { string s; cin >> s; int flag = 1; sort(s.begin(), s.end()); rep(i,s.size() - 1){ if(s[i] == s[i+1])flag = 0; } if(flag)yn; return 0; }