Count Distinct Subsequences

easy
Question Solve Solutions 
1. You are given a string.
2. You have to print the count of distinct and non-empty subsequences of the given string. 

Note -> String contains only lowercase letters.

Input Format

A String

Output Format

A number

Constraints

1 <= length of string <= 60

Example

Input
abc
Output
7
Previous
Print All Results In 0-1 Knapsack
Next
Count Of Distinct Palindromic Subsequences

Related Questions

easy Super Ugly Number easy Burst Balloons easy Cherry Pickup easy Regular Expression Matching easy Rod Cutting easy Russian Doll Envelopes easy Scramble String easy Temple Offerings easy Word Break easy Optimal Strategy For A Game easy Longest Bitonic Subsequence easy Count Palindromic Subsequences easy Longest Common Subsequence easy Longest Common Substring easy Longest Increasing Subsequence easy Distinct Transformations